On the Amortized Complexity of Zero-Knowledge Protocols

DOI10.1007/978-3-642-03356-8_11zbMath1252.94056OpenAlexW2100847176MaRDI QIDQ3183564

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)

Related Items (19)

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion ⋮ Public key authenticated encryption with keyword search from LWE ⋮ Efficient authentication from hard learning problems ⋮ Lattice-based programmable hash functions and applications ⋮ Efficient integer span program for hierarchical threshold access structure ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ Generic Fully Simulatable Adaptive Oblivious Transfer ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ 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 ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms

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