Filtern
Erscheinungsjahr
- 2002 (1) (entfernen)
Dokumenttyp
- Preprint (1) (entfernen)
Sprache
- Englisch (1)
Volltext vorhanden
- ja (1) (entfernen)
Gehört zur Bibliographie
- nein (1) (entfernen)
Schlagworte
- Commitment Scheme (1) (entfernen)
Institut
- Informatik (1) (entfernen)
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.