How to Prove Knowledge of Small Secrets

DOI10.1007/978-3-662-53015-3_17zbMath1406.94024OpenAlexW2501280492MaRDI QIDQ2829957

No author found.

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

lattice-based encryptioninteger commitmentshomomorphic hashingproofs of plaintext knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ 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 ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack

Uses Software

• SWIFFT

Cites Work

• Unnamed Item
• Unnamed Item
• Better Preprocessing for Secure Multiparty Computation
• (Leveled) fully homomorphic encryption without bootstrapping
• 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
• Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
• 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
• LEGO for Two-Party Secure Computation
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$