Two-sided malicious security for private intersection-sum with cardinality

DOI10.1007/978-3-030-56877-1_1zbMath1504.94170OpenAlexW3022916067MaRDI QIDQ2102051

Karn Seth, Peihan Miao, Sarvar Patel, Mariana Raykova, Mordechai M. Yung

Publication date: 7 December 2022

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

zbMATH Keywords

malicious securityshuffled distributed oblivious PRF

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Related Items

A fast and simple partially oblivious PRF, with applications ⋮ Hiding the input-size in multi-party private set intersection ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Private set operations from oblivious switching ⋮ Two-sided malicious security for private intersection-sum with cardinality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient set intersection with simulation-based security
• Efficient circuit-based PSI via cuckoo hashing
• Combining private set intersection with secure two-party computation
• Secure and efficient private set intersection cardinality using Bloom filter
• Two-sided malicious security for private intersection-sum with cardinality
• PSI from PaXoS: fast, malicious private set intersection
• Efficient circuit-based PSI with linear communication
• SpOT-light: lightweight private set intersection from sparse OT extension
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
• Randomizable Proofs and Delegatable Anonymous Credentials
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
• Efficient Set Operations in the Presence of Malicious Adversaries
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
• Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
• Private Intersection of Certified Sets
• A public key cryptosystem and a signature scheme based on discrete logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• Cuckoo hashing
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Privacy-Preserving Set Operations
• Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
• Public Key Cryptography - PKC 2005
• Improved Private Set Intersection Against Malicious Adversaries