Reverse public key encryption
dc.contributor.author | Naccache, David | |
dc.contributor.author | Steinwandt, Rainer | |
dc.contributor.author | Yung, Moti | |
dc.contributor.editor | Brömme, Arslan | |
dc.contributor.editor | Busch, Christoph | |
dc.contributor.editor | Hühnlein, Detlef | |
dc.date.accessioned | 2019-05-31T08:18:52Z | |
dc.date.available | 2019-05-31T08:18:52Z | |
dc.date.issued | 2009 | |
dc.description.abstract | This exposition paper suggests a new low-bandwidth publickey encryption paradigm. The construction turns a weak form of key privacy into message privacy as follows: let Ɛ be a public-key encryption algorithm. We observe that if the distributions Ɛ (pk0, \⦁ ) and Ɛ (pk1, \⦁ ) are indistinguishable for two public keys pk0, pk1, then a message bit b ∈ {0, 1} can be embedded in the choice of pkb. As the roles of the public-key and the plaintext are reversed, we refer to the new mode of operation as Reverse Public-Key Encryption (rpke). We present examples of and variations on the idea and explore RPKE's relationship with key privacy, and we also discuss how to employ it to enable a new implementation of deniable encryption. | en |
dc.identifier.isbn | 978-3-88579-249-1 | |
dc.identifier.pissn | 1617-5468 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/23181 | |
dc.language.iso | en | |
dc.publisher | Gesellschaft für Informatik e.V. | |
dc.relation.ispartof | BIOSIG 2009: biometrics and electronic signatures | |
dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-155 | |
dc.title | Reverse public key encryption | en |
dc.type | Text/Conference Paper | |
gi.citation.endPage | 170 | |
gi.citation.publisherPlace | Bonn | |
gi.citation.startPage | 155 | |
gi.conference.date | 17.–18. September 2009 | |
gi.conference.location | Darmstadt | |
gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1