85 search results - page 3 / 17 » Commitment Schemes and Zero-Knowledge Protocols |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s ide...
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...
IH
2001
Springer
13 years 12 months ago
2001
Springer
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a verifier of the presence of a watermark in certain stego-data without revealing any infor...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...