TY  - INPR
A1  - Fischlin, Marc
A2  - Preneel, Bart
T1  - On the impossibility of constructing non-interactive statistically-secret protocols from any trapdoor one-way function
N2  - 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.
KW  - Kryptologie
KW  - Kongress
KW  - San Jose
KW  - Online-Publikation
KW  - Random Oracle
KW  - Commitment Scheme
KW  - Oblivious Transfer
KW  - Oracle Query
KW  - Private Information Retrieval
Y1  - 2002
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4232
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12568
SN  - 978-3-540-43224-1
SN  - 3-540-43224-8
SN  - 978-3-540-45760-2
N1  - 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
SP  - 1
EP  - 27
ER  -