Non-interactive Proofs for Integer Multiplication

DOI10.1007/978-3-540-72540-4_24MaRDI QIDQ5429404zbMATH OpenOpenAlexFDO

Authors Rune Thorbek, Ivan B. Damgård

Publication date 29 November 2007

Published in Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72540-4_24

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
• scientific article; zbMATH DE number 1024046
• Theory of Cryptography
• Noninteractive Zero-Knowledge
• Publication:4941852

Cited in

(14)

• Theory of Cryptography
• Efficient integer span program for hierarchical threshold access structure
• A low complexity probabilistic test for integer multiplication
• Complexity and performance of secure floating-point polynomial evaluation protocols
• Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
• PRE: stronger security notions and efficient construction with non-interactive opening
• The ECCA Security of Hybrid Encryptions
• Private evaluation of a decision tree based on secret sharing
• Certifying giant nonprimes
• scientific article; zbMATH DE number 1418292 (Why is no real title available?)
• Non-interactive zero-sharing with applications to private distributed decision making
• Efficient VSS free of computational assumption
• Jump from Parallel to Sequential Proofs: Multiplicatives
• Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening

This page was built for publication: Non-interactive Proofs for Integer Multiplication

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