Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
By Masayuki Abe, Ronald Cramer, Serge Fehr. 2002
23 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Henry Corrigan-Gibbs
- Dan Boneh
- Sebastiaan de Hoogh
- Octavian Catrina
- Brent Waters
- Allison Bishop
- Marcel Keller
- Xavier Boyen
In Computational Theory and Mathematics
- Sebastiaan de Hoogh
- Henry Corrigan-Gibbs
- Dan Boneh
- Octavian Catrina
- Brent Waters
- Allison Bishop
- Xavier Boyen
- Marcel Keller
Citations in the corpus
- Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “Prior many-verifier protocols require relatively expensive public-key primitives [1] or require an amount of server-to-server traffic that grows linearly in the size of the circuit for the Valid function [10].”
- Improved Primitives for Secure Multiparty Integer Computation (2010, methodology): “A variant of the protocols without PRSS can use any extension of Shamir’s secret sharing to verifiable secret sharing (VSS) and an associated multiplication proof (e.g., [16, 1 ,8]).”