IACR
2011
13 years 11 days ago
2011
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
IACR
2011
13 years 11 days ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
IACR
2011
13 years 11 days ago
2011
We describe Charm, an extensible framework designed for rapid prototyping of cryptographic systems that utilize the latest advances in cryptography, such as identity and attribute...
JSS
2011
13 years 3 months ago
2011
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
CORR
2000
Springer
14 years 16 days ago
2000
Springer
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing...
DAM
2008
14 years 24 days ago
2008
Many research papers in pairing based cryptography treat pairings as a "black box". These papers build cryptographic schemes making use of various properties of pairings....
ICICS
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. To be accepted, a cryptographic scheme must come with a proof that it satisfies some standard security properties. However, because cryptographic schemes are based on no...
CRYPTO
2009
Springer
14 years 7 months ago
2009
Springer
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...
CCS
2009
ACM
14 years 7 months ago
2009
ACM
We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use ...