Password-protected secret-sharing schemes without random oracles

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a password-protected secret sharing scheme which is provably secure without the random oracles. Three tools enable us to achieve this property: the IND-CCA secure threshold encryption scheme of Libert and Yung, the linear encryption scheme and the technique for constructing a simulation-sound non-interactive zero knowledge proof for any language in NP.

Original languageEnglish
Title of host publicationProceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages566-570
Number of pages5
ISBN (Electronic)9784885522925
Publication statusPublished - 2014 Dec 8
Event2014 International Symposium on Information Theory and Its Applications, ISITA 2014 - Melbourne, Australia
Duration: 2014 Oct 262014 Oct 29

Publication series

NameProceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014

Other

Other2014 International Symposium on Information Theory and Its Applications, ISITA 2014
CountryAustralia
CityMelbourne
Period14/10/2614/10/29

Keywords

  • decision linear problem
  • password-protected secret sharing
  • simulation-sound non-interactive zero knowledge proof
  • standard model
  • subgroup decision problem

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'Password-protected secret-sharing schemes without random oracles'. Together they form a unique fingerprint.

Cite this