21 search results - page 2 / 5 » Efficient Constructions of Composable Commitments and Zero-K... |
TCC
2009
Springer
14 years 6 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...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
PKC
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
CRYPTO
2011
Springer
12 years 5 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...
EUROCRYPT
2000
Springer
13 years 9 months ago
2000
Springer
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...