Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Deterministic encryption

A deterministic encryption scheme (as opposed to a probabilistic encryption scheme) is a cryptosystem which always produces the same ciphertext for a… Expand
Wikipedia

Related topics

Related topics

13 relations
Block cipherCiphertextConvergent encryptionCryptosystem
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
CryptoBlaze: A partially homomorphic processor with multiple instructions and non-deterministic encryption support
Homomorphic computing has been suggested as a method to secure processing in insecure servers. One of the drawbacks of… Expand
  • figure 1
  • table I
  • figure 3
  • figure 4
  • table III
Highly Cited
2014
Highly Cited
2014
Searchable Encryption with Secure and Efficient Updates
Searchable (symmetric) encryption allows encryption while still enabling search for keywords. Its immediate application is cloud… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2013
Highly Cited
2013
Message-Locked Encryption and Secure Deduplication
We formalize a new cryptographic primitive that we call Message-Locked Encryption (MLE), where the key under which encryption and… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2013
Highly Cited
2013
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
This work presents the design and analysis of the first searchable symmetric encryption (SSE) protocol that supports conjunctive… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Highly Cited
2013
Highly Cited
2013
Learning with Rounding, Revisited: New Reduction, Properties and Applications
The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning… Expand
2012
2012
Incremental Deterministic Public-Key Encryption
Motivated by applications in large storage systems, we initiate the study of incremental deterministic public-key encryption… Expand
2010
2010
Formal Analysis of Privacy for Vehicular Mix-Zones
Safety critical applications for recently proposed vehicle to vehicle ad-hoc networks (VANETs) rely on a beacon signal, which… Expand
  • figure 1
  • figure 2
Highly Cited
2009
Highly Cited
2009
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2008
Highly Cited
2008
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
We strengthen the foundations of deterministic public-key encryption via definitional equivalences and standard-model constructs… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2008
Highly Cited
2008
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest… Expand
  • figure 1
  • figure 2
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE