Title
Key-Privacy in Public-Key Encryption
Abstract
We consider a novel security requirement of encryption schemes that we call "key-privacy" or "anonymity". It asks that an eavesdropper in possession of a ciphertext not be able to tell which specific key, out of a set of known public keys, is the one under which the ciphertext was created, meaning the receiver is anonymous from the point of view of the adversary. We investigate the anonymity of known encryption schemes. We prove that the El Gamal scheme provides anonymity under chosen-plaintext attack assuming the Decision Diffie-Hellman problem is hard and that the Cramer-Shoup scheme provides anonymity under chosen-ciphertext attack under the same assumption. We also consider anonymity for trapdoor permutations. Known attacks indicate that the RSA trapdoor permutation is not anonymous and neither are the standard encryption schemes based on it. We provide a variant of RSA-OAEP that provides anonymity in the random oracle model assuming RSA is one-way. We also give constructions of anonymous trapdoor permutations, assuming RSA is one-way, which yield anonymous encryption schemes in the standard model.
Year
Venue
Keywords
2001
ASIACRYPT
public-key encryption,rsa trapdoor permutation,trapdoor permutation,encryption scheme,cramer-shoup scheme,standard encryption scheme,chosen-ciphertext attack,chosen-plaintext attack,anonymous encryption scheme,el gamal scheme,anonymous trapdoor permutation,chosen ciphertext attack,standard model,public key,random oracle model,public key encryption
Field
DocType
ISBN
Optimal asymmetric encryption padding,Computer science,Computer security,Deterministic encryption,Attribute-based encryption,Theoretical computer science,Encryption,Trapdoor function,Probabilistic encryption,Anonymity,56-bit encryption
Conference
3-540-42987-5
Citations 
PageRank 
References 
189
16.89
22
Authors
4
Search Limit
100189
Name
Order
Citations
PageRank
Mihir Bellare1164371481.16
Alexandra Boldyreva22297114.80
A DESAI31193140.69
David Pointcheval418917.90