Robust distributed multiplication without interaction

DOI10.1007/3-540-48405-1_9MaRDI QIDQ4941852zbMATH OpenFDO

Authors Masayuki Abe

Publication date 26 July 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48405-1_9

zbMATH Keywords

Cramer-Shoup cryptosystemmulti-party computationnon-interactivityoptimally resilient distributed multiplication protocolround complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Non-interactive secure multiparty computation
• Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test
• scientific article; zbMATH DE number 176564
• Non-interactive Proofs for Integer Multiplication
• scientific article; zbMATH DE number 176562

Cited in

(9)

• Secure multiplication of shared secrets in the exponent
• Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
• Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
• Efficient hybrid encryption from ID-based encryption
• Tag-KEM/DEM: A new framework for hybrid encryption
• Provably secure threshold password-authenticated key exchange
• Non-interactive Proofs for Integer Multiplication
• Non-interactive zero-knowledge proofs to multiple verifiers
• Interactive threshold mercurial signatures and applications

This page was built for publication: Robust distributed multiplication without interaction

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