Joint encryption and message-efficient secure computation

MaRDI QIDQ2563544zbMATH OpenFDO

Authors Matthew Franklin, Stuart Haber

Publication date 30 June 1997

Published in Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

group-oriented cryptographymessage complexitypublic-key encryptionsecure distributed computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1024062
• On the message complexity of secure multiparty computation
• The broadcast message complexity of secure multiparty computation
• scientific article; zbMATH DE number 176564

Cited in

(11)

• Dynamic and efficient joint encryption scheme in the plain public key model
• Multi-party threshold private set intersection with sublinear communication
• Actively secure setup for SPDZ
• Asynchronous Multi-Party Computation with Quadratic Communication
• scientific article; zbMATH DE number 1024062 (Why is no real title available?)
• Theory of Cryptography
• Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
• Towards practical topology-hiding computation
• Fast secure computations on shared polynomials and applications to private set operations
• Correction to: ``Actively secure setup for SPDZ
• Revisiting module lattice-based homomorphic encryption and application to secure-MPC

This page was built for publication: Joint encryption and message-efficient secure computation

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