Sciweavers

4 search results - page 1 / 1
» Deterministic Encryption: Definitional Equivalences and Cons...
Sort
View
CRYPTO
2008
Springer
83views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas...
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
Alexandra Boldyreva, Serge Fehr, Adam O'Neill
SCN
2008
Springer
142views Communications» more  SCN 2008»
13 years 4 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
ASIACRYPT
2006
Springer
13 years 8 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth