Sciweavers

51 search results - page 5 / 11
» The Random Oracle Model and the Ideal Cipher Model Are Equiv...
Sort
View
IJNSEC
2006
110views more  IJNSEC 2006»
13 years 8 months ago
Password-based Encrypted Group Key Agreement
This paper presents an efficient password-based authenticated encrypted group key agreement protocol immune to dictionary attack under the computation Diffie-Hellman (CDH) assumpt...
Ratna Dutta, Rana Barua
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
13 years 10 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
EUROCRYPT
1998
Springer
14 years 23 days ago
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement. However, prior to the results presented here, there ap...
Victor Shoup, Rosario Gennaro
ACISP
2007
Springer
14 years 2 months ago
TCHo: A Hardware-Oriented Trapdoor Cipher
This paper improves the Finiasz-Vaudenay construction of TCHo, a hardware-oriented public-key cryptosystem, whose security relies on the hardness of finding a low-weight multiple ...
Jean-Philippe Aumasson, Matthieu Finiasz, Willi Me...
SCN
2008
Springer
142views Communications» more  SCN 2008»
13 years 8 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