Compact zero-knowledge arguments for Blum integers

DOI10.1016/J.TCS.2025.115155MaRDI QIDQ7001148zbMATH OpenFDO

Authors Jules Maire, Damien Vergnaud

Publication date 7 April 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115155

zbMATH Keywords

Blum integerMPC-in-the-headzero-knowledge arguments

Mathematics Subject Classification ID

Factorization; primality (11A51) Communication complexity, information complexity (68Q11) Cryptography (94A60)

Cites work

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A Simple Unpredictable Pseudo-Random Number Generator
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• Efficient generation of shared RSA keys
• Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
• scientific article; zbMATH DE number 4055525 (Why is no real title available?)
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
• Practic zero-knowledge proofs: Giving hints and using deficiencies
• Probabilistic encryption
• The Group of Signed Quadratic Residues and Applications
• The Knowledge Complexity of Interactive Proof Systems
• The return of the SDitH
• Zero-knowledge proofs from secure multiparty computation
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection

This page was built for publication: Compact zero-knowledge arguments for Blum integers

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