Succinct Diophantine-satisfiability arguments

DOI10.1007/978-3-030-64840-4_26OpenAlexW3083744584MaRDI QIDQ2691605

Patrick Towa, Damien Vergnaud

Publication date: 29 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_26

zbMATH Keywords

general Diophantine satisfiability problemsuccinct honest-verifier zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Recursively (computably) enumerable sets and degrees (03D25) Diophantine equations (11D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure hardware implementation of nonlinear functions in the presence of glitches
• Side-channel resistant crypto for less than 2,300 GE
• Efficient signature generation by smart cards
• A signature scheme based on the intractability of computing roots
• Transparent SNARKs from DARK compilers
• Short discrete log proofs for FHE and ring-LWE ciphertexts
• The first thorough side-channel hardware Trojan
• The complexity of certain multi-exponentiation techniques in cryptography
• Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
• Modern Computer Algebra
• One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
• Side-Channel Analysis Protection and Low-Latency in Action
• An Efficient Side-Channel Protected AES Implementation with Arbitrary Protection Order
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Consolidating Masking Schemes
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
• Bent Functions
• Advances in Cryptology - CRYPTO 2003
• Removing the Strong RSA Assumption from Arguments over the Integers
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Advances in Cryptology - ASIACRYPT 2003
• \textsc{SCInfer}: refinement-based verification of software countermeasures against side-channel attacks

This page was built for publication: Succinct Diophantine-satisfiability arguments