13 search results - page 3 / 3 » ctrsa 2003 |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
CTRSA
2003
Springer
13 years 10 months ago
2003
Springer
Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilien...
CTRSA
2009
Springer
14 years 3 days ago
2009
Springer
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the...