On the Amortized Complexity of Zero-Knowledge Protocols

DOI10.1007/978-3-642-03356-8_11MaRDI QIDQ3183564zbMATH OpenOpenAlexFDO

Authors Ronald Cramer, Ivan B. Damgård

Publication date 20 October 2009

Published in Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03356-8_11

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the amortized complexity of zero-knowledge protocols
• Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
• On the amortized complexity of zero knowledge protocols for multiplicative relations
• Zero-knowledge proofs from secure multiparty computation
• Subquadratic zero-knowledge

Cited in

(27)

• Efficient authentication from hard learning problems
• Compact zero-knowledge proofs of small Hamming weight
• CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
• Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
• Efficient, actively secure MPC with a dishonest majority: a survey
• Simultaneous amplification: the case of non-interactive zero-knowledge
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient integer span program for hierarchical threshold access structure
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• How to prove knowledge of small secrets
• Cryptography with auxiliary input and trapdoor from constant-noise LPN
• Efficient RSA key generation and threshold Paillier in the two-party setting
• On Efficient Zero-Knowledge PCPs
• Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
• Generic fully simulatable adaptive oblivious transfer
• Efficiency limitations for -protocols for group homomorphisms
• Improved (hierarchical) inner-product encryption from lattices
• Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
• Zero-knowledge arguments for subverted RSA groups
• Verifiable Decryption for Fully Homomorphic Encryption
• A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion
• Public key authenticated encryption with keyword search from LWE
• Lattice-based programmable hash functions and applications
• Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
• On sigma-protocols and (packed) black-box secret sharing schemes
• A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
• On the amortized complexity of zero-knowledge protocols

This page was built for publication: On the Amortized Complexity of Zero-Knowledge Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183564)