File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Lossy trapdoor relation and its applications to lossy encryption and adaptive trapdoor relation

TitleLossy trapdoor relation and its applications to lossy encryption and adaptive trapdoor relation
Authors
KeywordsAdaptive trapdoor relation
Lossy encryption
Lossy trapdoor functions
Lossy trapdoor relation
Issue Date2014
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, v. 8782, p. 162-177 How to Cite?
AbstractPeikert and Waters proposed the notion of lossy trapdoor function in STOC 2008. In this paper, we propose a relaxation of lossy trapdoor function, called lossy trapdoor relation. Unlike the lossy trapdoor function, lossy trapdoor relation does not require completely recovering the input but a public computable injective map of it. Interestingly, the lossy trapdoor relation maintains the application of lossy trapdoor function on the lossy encryption. Moreover, motivated by the construction of adaptive trapdoor relation proposed by Wee (Crypto 2010), we introduce all-but-one verifiable lossy trapdoor relation which is in fact a relaxation of all-but-one lossy trapdoor function.
Persistent Identifierhttp://hdl.handle.net/10722/311988
ISSN
2023 SCImago Journal Rankings: 0.606

 

DC FieldValueLanguage
dc.contributor.authorXue, Haiyang-
dc.contributor.authorLu, Xianhui-
dc.contributor.authorLi, Bao-
dc.contributor.authorLiu, Yamin-
dc.date.accessioned2022-04-06T04:31:55Z-
dc.date.available2022-04-06T04:31:55Z-
dc.date.issued2014-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, v. 8782, p. 162-177-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/311988-
dc.description.abstractPeikert and Waters proposed the notion of lossy trapdoor function in STOC 2008. In this paper, we propose a relaxation of lossy trapdoor function, called lossy trapdoor relation. Unlike the lossy trapdoor function, lossy trapdoor relation does not require completely recovering the input but a public computable injective map of it. Interestingly, the lossy trapdoor relation maintains the application of lossy trapdoor function on the lossy encryption. Moreover, motivated by the construction of adaptive trapdoor relation proposed by Wee (Crypto 2010), we introduce all-but-one verifiable lossy trapdoor relation which is in fact a relaxation of all-but-one lossy trapdoor function.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.subjectAdaptive trapdoor relation-
dc.subjectLossy encryption-
dc.subjectLossy trapdoor functions-
dc.subjectLossy trapdoor relation-
dc.titleLossy trapdoor relation and its applications to lossy encryption and adaptive trapdoor relation-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-319-12475-9_12-
dc.identifier.scopuseid_2-s2.0-84909994517-
dc.identifier.volume8782-
dc.identifier.spage162-
dc.identifier.epage177-
dc.identifier.eissn1611-3349-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats