On the impossibility of constructing non-interactive statistically-secret protocols from any trapdoor one-way function
- We show that non-interactive statistically-secret bit commitment cannot be constructed from arbitrary black-box one-to-one trapdoor functions and thus from general public-key cryptosystems. Reducing the problems of non-interactive crypto-computing, rerandomizable encryption, and non-interactive statistically-sender-private oblivious transfer and low-communication private information retrieval to such commitment schemes, it follows that these primitives are neither constructible from one-to-one trapdoor functions and public-key encryption in general. Furthermore, our separation sheds some light on statistical zeroknowledge proofs. There is an oracle relative to which one-to-one trapdoor functions and one-way permutations exist, while the class of promise problems with statistical zero-knowledge proofs collapses in P. This indicates that nontrivial problems with statistical zero-knowledge proofs require more than (trapdoor) one-wayness.
Volltext Dateien herunterladen
Weitere Dienste
| Verfasserangaben: | Marc FischlinGND |
|---|---|
| URN: | urn:nbn:de:hebis:30-12568 |
| DOI: | https://doi.org/10.1007/3-540-45760-7_7 |
| ISBN: | 978-3-540-43224-1 |
| ISBN: | 3-540-43224-8 |
| ISBN: | 978-3-540-45760-2 |
| Herausgeber*in: | Bart Preneel |
| Dokumentart: | Preprint |
| Sprache: | Englisch |
| Jahr der Fertigstellung: | 2002 |
| Jahr der Erstveröffentlichung: | 2002 |
| Veröffentlichende Institution: | Universitätsbibliothek Johann Christian Senckenberg |
| Datum der Freischaltung: | 20.07.2005 |
| Freies Schlagwort / Tag: | Commitment Scheme; Oblivious Transfer; Oracle Query; Private Information Retrieval; Random Oracle |
| GND-Schlagwort: | Kryptologie; Kongress; San Jose; Online-Publikation |
| Seitenzahl: | 27 |
| Erste Seite: | 1 |
| Letzte Seite: | 27 |
| Bemerkung: | Erschienen in: Bart Preneel (Hrsg.): Topics in cryptology : the Cryptographers' Track at the RSA Conference 2002 ; proceedings, Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London ; Milan ; Paris ; Tokyo : Springer, 2002, Lecture notes in computer science ; Vol. 2271, S. 79-95, ISBN: 978-3-540-43224-1, ISBN: 3-540-43224-8, ISBN: 978-3-540-45760-2, doi:10.1007/3-540-45760-7_7 |
| Quelle: | RSA Security 2002 Cryptographer's Track. - Lecture notes in computer science, vol. 2271, pp. 79-95, Springer-Verl., 2002 - http://link.springer.de/link/service/series/0558/tocs/t2271.htm , http://www.mi.informatik.uni-frankfurt.de/research/papers/fischlin |
| HeBIS-PPN: | 226524515 |
| Institute: | Informatik und Mathematik / Mathematik |
| Informatik und Mathematik / Informatik | |
| DDC-Klassifikation: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
| Lizenz (Deutsch): |  Deutsches Urheberrecht |
