Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack

DOI10.1007/978-3-319-56620-7_17zbMath1411.94056OpenAlexW2572551486MaRDI QIDQ5738887

Xing, Chaoping, Chen Yuan, Ronald Cramer, Ivan B. Damgård

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25749

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Short signatures from regular syndrome decoding in the head ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Lattice-Based Proof of a Shuffle ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ One-Shot Verifiable Encryption from Lattices

Uses Software

• SWIFFT

Cites Work

• Unnamed Item
• Unnamed Item
• On the amortized complexity of zero-knowledge protocols
• Asymptotically optimal switching circuits
• (Leveled) fully homomorphic encryption without bootstrapping
• How to Prove Knowledge of Small Secrets
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Semi-homomorphic Encryption and Multiparty Computation
• Collision-Free Hashing from Lattice Problems
• On the Amortized Complexity of Zero-Knowledge Protocols
• SWIFFT: A Modest Proposal for FFT Hashing
• Randomness conductors and constant-degree lossless expanders
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

This page was built for publication: Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack