scientific article; zbMATH DE number 1302863

zbMath0964.94019MaRDI QIDQ4249348

Ronald Cramer, Ivan B. Damgård

Publication date: 23 July 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

communication complexityfinite prime fieldcommitment schemesinteractive proof systemRSA assumptionarithmetic circuits over finite prime fieldsBoolean circuit satisfiabilityefficient zero-knowledge proofsexistence of \(q\)-one way group homomorphismshardness of discrete logpolynomial security of Diffie-Hellman encryption

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Analytic circuit theory (94C05)

Related Items (17)

Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs ⋮ Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ How to deal with malicious users in privacy‐preserving distributed data mining ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Zero-knowledge proofs for committed symmetric Boolean functions

This page was built for publication: