129 search results - page 11 / 26 » iacr 2011 |
IACR
2011
13 years 9 months 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 9 months ago
2011
Distance bounding protocols are typically analyzed with respect to three types of attacks: Distance Fraud, Mafia Fraud, and Terrorist Fraud. We define and analyze a fourth main ...
63
Voted
IACR
2011
13 years 9 months ago
2011
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...
IACR
2011
13 years 9 months ago
2011
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
104
click to vote
IACR
2011
13 years 9 months ago
2011
Hummingbird-2 is an encryption algorithm with a 128-bit secret key and a 64-bit initialization vector. Hummingbird-2 optionally produces an authentication tag for each message proc...