Two-sided malicious security for private intersection-sum with cardinality
type: Item
instance of: scholarly article
title: Two-sided malicious security for private intersection-sum with cardinality
zbMATH Open document ID: 1504.94170
DOI: 10.1007/978-3-030-56877-1_1
author: Peihan Miao
author: Sarvar Patel
author: Mariana Raykova
author: Karn Seth
author: Moti Yung
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M25
zbMATH DE Number: 7627815
zbMATH Keywords: malicious security
zbMATH Keywords: shuffled distributed oblivious PRF
MaRDI profile type: Publication
full work available at URL: 978-3-030-56877-1 1
OpenAlex ID: W3022916067
cites work: Efficient Zero-Knowledge Argument for Correctness of a Shuffle
cites work: Randomizable Proofs and Delegatable Anonymous Credentials
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q3374927
cites work: Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
cites work: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4364567
cites work: Private Intersection of Certified Sets
cites work: Combining private set intersection with secure two-party computation
cites work: Q2724587
cites work: Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
cites work: Secure and efficient private set intersection cardinality using Bloom filter
cites work: Public Key Cryptography - PKC 2005
cites work: Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Efficient set intersection with simulation-based security
cites work: Q4364540
cites work: Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
cites work: Linear Algebra with Sub-linear Zero-Knowledge Arguments
cites work: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
cites work: Efficient Set Operations in the Presence of Malicious Adversaries
cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
cites work: Privacy-Preserving Set Operations
cites work: Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
cites work: Cuckoo hashing
cites work: Q4035712
cites work: SpOT-light: lightweight private set intersection from sparse OT extension
cites work: PSI from PaXoS: fast, malicious private set intersection
cites work: Efficient circuit-based PSI with linear communication
cites work: Efficient circuit-based PSI via cuckoo hashing
cites work: Improved Private Set Intersection Against Malicious Adversaries
description: scientific article; zbMATH DE number 7627815