Sciweavers

37 search results - page 7 / 8
» eurocrypt 2005
Sort
View
EUROCRYPT
2005
Springer
14 years 4 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
ICALP
2005
Springer
14 years 4 months ago
On Steganographic Chosen Covertext Security
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...
Nicholas Hopper
JUCS
2007
96views more  JUCS 2007»
13 years 10 months ago
Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions
At Eurocrypt 2005, Boneh, Boyen and Goh presented a constant size ciphertext hierarchical identity based encryption (HIBE) protocol. Our main contribution is to present a variant ...
Sanjit Chatterjee, Palash Sarkar
CANS
2005
Springer
120views Cryptology» more  CANS 2005»
14 years 4 months ago
The Second-Preimage Attack on MD4
In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicabl...
Hongbo Yu, Gaoli Wang, Guoyan Zhang, Xiaoyun Wang
TCC
2007
Springer
110views Cryptology» more  TCC 2007»
14 years 5 months ago
Robuster Combiners for Oblivious Transfer
Abstract. A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k...
Remo Meier, Bartosz Przydatek, Jürg Wullschle...