Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

By Torben P. Pedersen. 1991

Subfields: Privacy & Security, Information Theory

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 Information Theory

Citations in the corpus

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].”
Verifying computations with state (2013, methodology): “Relative to the protocol of Pedersen [61], our scheme makes a stronger cryptographic assumption but saves an order of magnitude in constraint size.”
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes (1998, methodology): “For easier description of our protocols, we will use a particular commitment scheme which is due to Pedersen [31]: A value a ∈ ZQ is committed to by ca := gh, where r is randomly chosen from ZQ.”
A protocol for property-based attestation (2006, methodology): “We apply the commitment scheme by Pedersen [24]: Let skm be the secret commitment key.”
Distributed Paillier Cryptosystem without Trusted Dealer (2010, methodology): “We use the Pedersen’s VSS scheme [34] over the integers introduced in [10,31] that works with a group of large known order.”
Doubly-Efficient zkSNARKs Without Trusted Setup (2018, methodology): “(The Pedersen commitment [80], described in Appx.”
New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, methodology): “In this section, we focus on simultaneous modular exponentiations u1u b 2 mod p, which play an important role in many cryptographic primitives such as chameleon hashing [5], [6], [23], [24], [38], [48] and trapdoor commitment [9], [44], [34].”
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (2008, methodology): “We can instantiate our protocol with either the El-Gamal [6] or Paillier [22] homomorphic encryptions schemes.”
Cooperative Security for Network Coding File Distribution (2006, background): “[31] was the first to provide a mechanism that allows for intermediate nodes to check erasure codes on-the-fly using homomorphic hashing functions [4], [5], [7], [13], [28], [37], [40].”
Charm: a framework for rapidly prototyping cryptosystems (2013, unknown): “Miscellaneous GS07 [48] Commitment Pairing CRS 28 Pedersen [66] Commitment EC/Integer Standard 16 AdM05 [7] Chameleon Hash Integer ROM 24 RSA HW09 [51] Chameleon Hash Integer Standard 29 VRF [52] Verifiable Random Functions Pairing Standard 47”