Sciweavers

524 search results - page 44 / 105
» On the Security of the DeKaRT Primitive
Sort
View
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
14 years 20 days ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
14 years 20 days ago
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
Jonathan J. Hoch, Adi Shamir
ACSAC
2001
IEEE
14 years 20 days ago
Privacy-Preserving Cooperative Statistical Analysis
The growth of the Internet opens up tremendous opportunities for cooperative computation, where the answer depends on the private inputs of separate entities. Sometimes these comp...
Wenliang Du, Mikhail J. Atallah
ICISC
2008
126views Cryptology» more  ICISC 2008»
13 years 10 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
IWFM
2003
13 years 10 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins