Size-Hiding Computation for Multiple Parties

DOI10.1007/978-3-662-53890-6_31MaRDI QIDQ2953801zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Hiding the input-size in secure two-party computation
• Hiding the input-size in multi-party private set intersection
• Secure multiparty computation and secret sharing
• Multiparty Computation from Somewhat Homomorphic Encryption
• scientific article; zbMATH DE number 176543
• On the size of shares for secret sharing schemes
• Secure multi-party computation in large networks
• scientific article; zbMATH DE number 1583776
• Scalable Secure Multiparty Computation
• Secure multi-party computation

Cites work

• (If) size matters: size-hiding private set intersection
• An information-theoretic model for steganography
• Evaluating Branching Programs on Encrypted Data
• Executable proofs, input-size hiding secure computation and a new ideal world
• Hiding the input-size in secure two-party computation
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On the communication complexity of secure function evaluation with long output
• Provably Secure Steganography
• Secure database commitments and universal arguments of quasi knowledge

Cited in

(3)

• Hiding the input-size in multi-party private set intersection
• Executable proofs, input-size hiding secure computation and a new ideal world
• Hiding the input-size in secure two-party computation

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

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