Efficient set operations in the presence of malicious adversaries
type: Item
instance of: scholarly article
title: Efficient set operations in the presence of malicious adversaries
zbMATH Open document ID: 1272.94034
author: Carmit Hazay
author: Kobbi Nissim
published in: Journal of Cryptology
publication date: 2012-07-10T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6054130
zbMATH Keywords: secure two-party protocols
zbMATH Keywords: set intersection
zbMATH Keywords: set union
zbMATH Keywords: malicious parties
zbMATH Keywords: constant-round protocols
zbMATH Keywords: oblivious pseudorandom function evaluation protocol
MaRDI profile type: Publication
full work available at URL: s00145-011-9098-x
OpenAlex ID: W2167485997
Wikidata QID: Q59379655
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
cites work: Balanced Allocations
cites work: Theory of Cryptography
cites work: Security and composition of multiparty cryptographic protocols
cites work: Private Intersection of Certified Sets
cites work: Q4940695
cites work: Q3374926
cites work: Q2724587
cites work: Q4409144
cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
cites work: Secure multiparty computation of approximations
cites work: Q4536289
cites work: Foundations of Cryptography
cites work: How to construct constant-round zero-knowledge proof systems for NP
cites work: Probabilistic encryption
cites work: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
cites work: Secure Linear Algebra Using Linearly Recurrent Sequences
cites work: Privacy-Preserving Set Operations
cites work: Privacy preserving data mining
cites work: Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
cites work: Communication preserving protocols for secure function evaluation
cites work: Number-theoretic constructions of efficient pseudo-random functions
cites work: Q4318686
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Q4035712
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: Q3210171
cites work: How asymmetry helps load balancing
DOI: 10.1007/S00145-011-9098-X
DBLP publication ID: journals/joc/HazayN12
description: scientific article; zbMATH DE number 6054130