scientific article; zbMATH DE number 1302863
zbMATH Open0964.94019MaRDI QIDQ4249348FDOQ4249348
Ronald Cramer, Ivan B. Damgård
Publication date: 23 July 2001
Title of this publication is not available (Why is that?)
Recommendations
communication complexitycommitment schemesinteractive proof systemRSA assumptionfinite prime fieldarithmetic circuits over finite prime fieldsBoolean circuit satisfiabilityefficient zero-knowledge proofsexistence of \(q\)-one way group homomorphismshardness of discrete logpolynomial security of Diffie-Hellman encryption
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Analytic circuit theory (94C05)
Cited In (23)
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Rogue-instance security for batch knowledge proofs
- Zero-knowledge proofs for committed symmetric Boolean functions
- Title not available (Why is that?)
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Efficient NIZK arguments with straight-line simulation and extraction
- An accurate, scalable and verifiable protocol for federated differentially private averaging
- Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Cryptographic reverse firewalls for interactive proof systems
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- How to deal with malicious users in privacy‐preserving distributed data mining
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Improved OR-Composition of Sigma-Protocols
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Algebraic (trapdoor) one-way functions: constructions and applications
- HyperNova: recursive arguments for customizable constraint systems
- Succinct Diophantine-satisfiability arguments
- Vector commitments over rings and compressed \(\varSigma \)-protocols
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249348)
