Key-Privacy in Public-Key Encryption

By Mihir Bellare, Alexandra Boldyreva, Anand Desai, David Pointcheval. 2001

511 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Zerocash: Decentralized Anonymous Payments from Bitcoin (2014, background): “In addition, (pkenc, skenc) is a key pair for a key-private encryption scheme [21].”
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation (2001, background): “[3] studied key-private encryption (which is what we call key-oblivious encryption).”
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)* (2000, background): “study this concept from different perspectives [7], [20].”
Blurry-ORAM: A Multi-Client Oblivious Storage Architecture (2016, background): “The latter notion is referred to as ‘key privacy’, introduced in [2] and is modeled similarly to the INDCPA game, but in the challenge phase, the adversary sends a message and two keys to the challenger.”
Multi-Dimensional Range Query over Encrypted Data (2007, background): “The Decision Linear assumption, ﬁrst proposed by Boneh, Boyen and Shacham for group signatures [9], posits the hardness of the following problem: , where z 1 , z 2 , z 3 , z 4 are picked at random from Z p , decide whether Z = g z 3 + z 4 .”
Bonsai Trees, or How to Delegate a Lattice Basis (2010, background): “Anonymity is a useful property in many applications, such as fully private communication [7] and searching on encrypted data [11, 1].”
Seeing-is-believing: using camera phones for human-verifiable authentication (2005, background): “It is then advisable that the standard public key protocol that is used with SiB authentication is key-private [5].”
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, unknown): “[4].”
Building an Encrypted and Searchable Audit Log (2004, background): “The particular IdentityBased Encryption scheme we have chosen also satisfies a stronger security property, namely key-privacy[1], which implies that an adversary can obtain no information about what public keywi was used to produce any ciphertext ci .”
Public Key Encryption with Keyword Search Revisited (2008, methodology): “Deﬁned in the following is the security of PEKS against chosen keyword attack, which is similar to the “key privacy” notion for public key encryption deﬁned in [1].”
Fuzzy Identity-Based Encryption (2005, methodology): “Also, a Fuzzy-IBE scheme that hides the public key that was used to encrypt the ciphertext [ 1 ] is intriguing.”