92 search results - page 9 / 19 » Generating Shorter Bases for Hard Random Lattices |
110
Voted
STOC
2003
ACM
16 years 1 days ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
111
click to vote
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
A fault attack consists in inducing hardware malfunctions in order to recover secrets from electronic devices. One of the most famous fault attack is Bellcore’s attack against RS...
CRYPTO
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
117
Voted
DAC
2005
ACM
16 years 21 days ago
2005
ACM
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...