9 search results - page 1 / 2 » Pairing-Based Non-interactive Zero-Knowledge Proofs |
PAIRING
2010
Springer
13 years 2 months ago
2010
Springer
IACR
2011
12 years 3 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
FOCS
1999
IEEE
13 years 8 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
FOCS
2006
IEEE
13 years 10 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...
SECRYPT
2007
13 years 5 months ago
2007
In this paper, we study the opacity property of verifiably encrypted signatures (VES) of Boneh et al. (proposed in Eurocrypt 2003). Informally, opacity implies that although some...