Secure set intersection with untrusted hardware tokens

DOI10.1007/978-3-642-19074-2_1MaRDI QIDQ3073691zbMATH OpenOpenAlexFDO

Authors Benny Pinkas, Ahmad-Reza Sadeghi, Thomas Schneider, Ivan Visconti, Marc Fischlin

Publication date 11 February 2011

Published in Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)

Full work available at URL https://encrypto.de/papers/FPSSV11.pdf

zbMATH Keywords

cryptographic protocolsset intersectionuntrusted hardware

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Founding Cryptography on Tamper-Proof Hardware Tokens
• Fast secure computation of set intersection
• Efficient set operations in the presence of malicious adversaries
• Secure computation using leaky tokens
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware

Cites work

• (If) size matters: size-hiding private set intersection
• Advances in Cryptology - EUROCRYPT 2004
• Bug Attacks
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Efficient set operations in the presence of malicious adversaries
• Fast secure computation of set intersection
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Linear-complexity private set intersection protocols secure in malicious model
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• One-Time Programs
• Privacy-Preserving Set Operations
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Truly efficient string oblivious transfer using resettable tamper-proof tokens
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Multiparty Computation with Partially Isolated Parties
• Universally composable zero-knowledge arguments and commitments from signature cards

Cited in

(3)

• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• Privately computing set-union and set-intersection cardinality via Bloom filters
• Practically efficient private set intersection from trusted hardware with side-channels

Describes a project that uses

Uses Software

• Trustedpals

This page was built for publication: Secure set intersection with untrusted hardware tokens

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