Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead

DOI10.1007/978-3-642-36594-2_23zbMath1315.94096OpenAlexW29662496MaRDI QIDQ4910290

Abhi Shelat, Mona Sergi, Steven Myers

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_23

zbMATH Keywords

secure multi-party computationproof of knowledgefully homomorphic encryptionthreshold encryptioncommunication and round complexity

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs ⋮ Multikey Fully Homomorphic Encryption and Applications

This page was built for publication: Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead