How to prove knowledge of small secrets

DOI10.1007/978-3-662-53015-3_17MaRDI QIDQ2829957zbMATH OpenOpenAlexFDO

Authors Carsten Baum, Ivan B. Damgård, Kasper Green Larsen, Michael P. Nielsen

Publication date 9 November 2016

Published in Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53015-3_17

zbMATH Keywords

homomorphic hashinginteger commitmentslattice-based encryptionproofs of plaintext knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
• On the Amortized Complexity of Zero-Knowledge Protocols
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Compact zero-knowledge proofs of small Hamming weight
• More efficient amortization of exact zero-knowledge proofs for LWE

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Better preprocessing for secure multiparty computation
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• Collision-free hashing from lattice problems
• Efficient fully homomorphic encryption from (standard) LWE
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Introduction to modern cryptography
• Lattice-Based Identification Schemes Secure Under Active Attacks
• LEGO for Two-Party Secure Computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• On the Amortized Complexity of Zero-Knowledge Protocols
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Semi-homomorphic encryption and multiparty computation
• SWIFFT: A Modest Proposal for FFT Hashing

Cited in

(15)

• Compact zero-knowledge proofs of small Hamming weight
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Practical non-interactive publicly verifiable secret sharing with thousands of parties
• Efficient, actively secure MPC with a dishonest majority: a survey
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• Logic Programming
• One-shot verifiable encryption from lattices
• Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
• Short signatures from regular syndrome decoding in the head
• Verifiable Decryption for Fully Homomorphic Encryption
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Lattice-based inner product argument
• A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
• Lattice-based zero-knowledge arguments for additive and multiplicative relations
• Efficient lattice-based polynomial evaluation and batch ZK arguments

Describes a project that uses

Uses Software

• SWIFFT

This page was built for publication: How to prove knowledge of small secrets

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