608 search results - page 57 / 122 » Interactive Oracle Proofs |
108
Voted
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
110
Voted
CRYPTO
2008
Springer
15 years 4 months ago
2008
Springer
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
118
Voted
CRYPTO
2010
Springer
15 years 3 months ago
2010
Springer
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
134
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
155
click to vote
CRYPTO
2011
Springer
14 years 2 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...