Size-Hiding Computation for Multiple Parties

DOI10.1007/978-3-662-53890-6_31zbMath1407.94151OpenAlexW2556573595MaRDI QIDQ2953801

Eiji Okamoto, Kazumasa Shinagawa, Goichiro Hanaoka, Koji Nuida, Takashi Nishide

Publication date: 6 January 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_31

zbMATH Keywords

secure multiparty computationsize-hiding

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Hiding the input-size in multi-party private set intersection

Cites Work

• An information-theoretic model for steganography
• Hiding the Input-Size in Secure Two-Party Computation
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Secure Database Commitments and Universal Arguments of Quasi Knowledge
• Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World
• On the Communication Complexity of Secure Function Evaluation with Long Output
• (If) Size Matters: Size-Hiding Private Set Intersection
• Evaluating Branching Programs on Encrypted Data
• Provably Secure Steganography

This page was built for publication: Size-Hiding Computation for Multiple Parties