Multi-party PSM, revisited: improved communication and unbalanced communication

DOI10.1007/978-3-030-90453-1_7OpenAlexW2952887348MaRDI QIDQ2697857

Tianren Liu, Léonard Assouline

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_7

zbMATH Keywords

communication complexityprivate simultaneous Messages model

Mathematics Subject Classification ID

Cryptography (94A60) Communication theory (94A05)

Related Items (1)

Private simultaneous messages based on quadratic residues

Cites Work

• Unnamed Item
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
• The complexity of multiparty PSM protocols and related models
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Conditional disclosure of secrets via non-linear reconstruction
• Secret-sharing schemes for general and uniform access structures
• A minimal model for secure computation (extended abstract)
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
• Ad Hoc PSM Protocols: Secure Computation Without Coordination
• On the Cryptographic Complexity of the Worst Functions
• The communication complexity of private simultaneous messages, revisited

This page was built for publication: Multi-party PSM, revisited: improved communication and unbalanced communication