Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

By Ronald Cramer, Ivan Bjerre Damgård, Berry Schoenmakers. 1994

Subfields: Privacy & Security, Automated Theorem Proving & Formal Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Privacy & Security

In Automated Theorem Proving & Formal Methods

Citations in the corpus

Geppetto: Versatile Verifiable Computation (2015, methodology): “[42] build on Σprotocols [24], while the work of Backes et al.”
Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (2013, methodology): “The commitment scheme we use is based on Pedersen commitments [18] and we use standard zero-knowledge protocols to prove modular arithmetic relations between the committed values [19], [20] as well as conjunctions of such arithmetic relations [21].”
Pinocchio: Nearly Practical Verifiable Computation (2013, methodology): “[63] adopt an approach based on Σprotocols [65].”
Automated Synthesis of Privacy-Preserving Distributed Applications (2011, methodology): “We proved that the implementations output by the compiler enforce the intended authorization policies and we conducted an experimental evaluation to demonstrate the feasibility of our approach.”
Optimal Rate Private Information Retrieval from Homomorphic Encryption (2015, methodology): “Finally, to achieve the stronger security notion of simulatability [5], instead of using the Naor-Pinkas transformation, the encrypter can accompany each of his χ ciphertexts with a standard zero-knowledge proof [10, 11] that it encrypts a Boolean value, and then prove that their sum encrypts 1.”
Zerocoin: Anonymous Distributed E-Cash from Bitcoin (2013, methodology): “Our protocols use zero-knowledge proofs that can be instantiated using the technique of Schnorr [18], with extensions due to e.g., [19] [20] [21] [22].”
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (2008, background): “The protocol is a 7-move public coin perfect SHVZK argument of knowledge ofπ ∈ Σ andRij ∈ Rpk soEij = eπ−1(ij)Epk(1;Rij).”
One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries (2013, background): “’s proofs of partial knowledge [18] and Bellare et al.”
Mix and Match: Secure Function Evaluation via Ciphertexts (2000, methodology): “This may be accomplished efficiently using appropriate variants on protocols elaborated in [13,17].”
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (2007, background): “This proof can be carried out using, for example, the proofs of partial knowledge of [6].”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, methodology): “A much more efficient way for performing such n-out-ofk threshold compositions is to apply the technique from [49], instantiated with Shamir’s secret sharing scheme [50].”
Advances in Cryptology — ASIACRYPT 2002 (2002, methodology): “[24,17] and group signatures [11,8] shielding the sender’s identity.”
A Survey of Verifiable Computation (2017, background): “Both Almeida et al. [62] and Meiklejohn et al. [71] designed their schemes based on S-protocols [72].”
Compact E-Cash (2005, methodology): “In the common parameters model, we use several previously known results for proving statements about discrete logarithms, such as (1) proof of knowledge of a discrete logarithm modulo a prime [39] or a composite [33, 29], (2) proof of knowledge of equality of representation modulo two (possibly diff”