Sciweavers

524 search results - page 9 / 105
» On the Security of the DeKaRT Primitive
Sort
View
EUROCRYPT
2000
Springer
14 years 1 months ago
Exposure-Resilient Functions and All-or-Nothing Transforms
Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key...
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kus...
CSFW
2004
IEEE
14 years 1 months ago
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protocol environ...
Michael Backes, Birgit Pfitzmann
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
14 years 7 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 7 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
CRYPTO
2009
Springer
131views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
Benny Applebaum, David Cash, Chris Peikert, Amit S...