28 search results - page 4 / 6 » Zero-Knowledge Sets |
STOC
2003
ACM
14 years 7 months 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...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
CRYPTO
2011
Springer
12 years 7 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...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...