作者: Amit Sahai , Brent Waters
关键词: Deniable encryption 、 Functional encryption 、 Cryptography 、 Mathematics 、 Probabilistic encryption 、 Ciphertext indistinguishability 、 Theoretical computer science 、 Obfuscation (software) 、 Encryption 、 Computer security 、 Multiple encryption
摘要: We introduce a new technique, that we call punctured programs, to apply indistinguishability obfuscation towards cryptographic problems. use this technique carry out systematic study of the applicability variety goals. Along way, resolve 16-year-old open question Deniable Encryption, posed by Canetti, Dwork, Naor, and Ostrovsky in 1997: In deniable encryption, sender who is forced reveal an adversary both her message randomness she used for encrypting it should be able convincingly provide "fake" can explain any alternative would like pretend sent. giving first construction encryption does not require pre-planning party must later issue denial. addition, show generality our programs also constructing core objects from one-way functions (or close variants). particular obtain: public key short "hash-and-sign" selectively secure signatures, chosen-ciphertext non-interactive zero knowledge proofs (NIZKs), injective trapdoor functions, oblivious transfer. These results suggest possibility becoming "central hub" cryptography.