Atomic Secure Multi-party Multiplication with Low Communication

DOI10.1007/978-3-540-72540-4_19MaRDI QIDQ5429399zbMATH OpenOpenAlexFDO

Authors Ronald Cramer, Robbert de Haan, 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_19

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 176564
• Multi-party computation with conversion of secret sharing
• Perfectly-secure multiplication for any \(t < n/3\)
• scientific article; zbMATH DE number 1583776
• On the communication required for unconditionally secure multiplication

Cited in

(19)

• Secure multiplication of shared secrets in the exponent
• Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices
• On the information ratio of non-perfect secret sharing schemes
• Secure computation with constant communication overhead using multiplication embeddings
• Reducing communication channels in MPC
• A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol
• Highly efficient OT-based multiplication protocols
• A note on ramp secret sharing schemes from error-correcting codes
• On the communication required for unconditionally secure multiplication
• Secure computation, I/O-efficient algorithms and distributed signatures
• Recent advances in non-perfect secret sharing schemes
• Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test
• Secret sharing comparison by transformation and rotation
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• Perfectly-secure multiplication for any \(t < n/3\)
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
• Improved single-round secure multiplication using regenerating codes
• Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
• Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness

This page was built for publication: Atomic Secure Multi-party Multiplication with Low Communication

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