Sciweavers

362 search results - page 19 / 73
» Abstraction in Cryptography
Sort
View
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 11 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
FOSAD
2004
Springer
14 years 26 days ago
A Tutorial on Physical Security and Side-Channel Attacks
Abstract. A recent branch of cryptography focuses on the physical constraints that a real-life cryptographic device must face, and attempts to exploit these constraints (running ti...
François Koeune, François-Xavier Sta...
EUROCRYPT
2010
Springer
14 years 9 days ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
FC
1998
Springer
121views Cryptology» more  FC 1998»
13 years 11 months ago
Cryptanalysis of SPEED
Abstract. The cipher family SPEED (and an associated hashing mode) was recently proposed in Financial Cryptography '97. This paper cryptanalyzes that proposal, in two parts: F...
Chris Hall, John Kelsey, Bruce Schneier, David Wag...
EUROCRYPT
2007
Springer
14 years 1 months ago
General Ad Hoc Encryption from Exponent Inversion IBE
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
Xavier Boyen