Multi-Party Protocols, Information Complexity and Privacy

DOI10.1145/3313230MaRDI QIDQ5205794zbMATH OpenOpenAlexWikidataFDO

Authors Iordanis Kerenidis, Adi Rosén, Florent Urrutia

Publication date 16 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/6469/

zbMATH Keywords

multi-party communication complexitypeer-to-peer communication complexityprivate computationrandomness

Mathematics Subject Classification ID

Privacy of data (68P27) Communication complexity, information complexity (68Q11) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Multi-party protocols, information complexity and privacy
• scientific article; zbMATH DE number 1024014
• Advances in Cryptology - EUROCRYPT 2004
• Theory and Practice of Multiparty Computation
• Security and composition of multiparty cryptographic protocols
• On the message complexity of secure multiparty computation
• Privacy and Communication Complexity
• Multiparty Computations in Non-private Environments

Cited in

(7)

• The complexity of multiparty PSM protocols and related models
• Making randomness public in unbounded-round information complexity
• scientific article; zbMATH DE number 1024014 (Why is no real title available?)
• Multi-party protocols, information complexity and privacy
• scientific article; zbMATH DE number 7319029 (Why is no real title available?)
• Public vs private coin in bounded-round information
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: Multi-Party Protocols, Information Complexity and Privacy

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