Efficient Concurrent Covert Computation of String Equality and Set Intersection

DOI10.1007/978-3-319-29485-8_10MaRDI QIDQ2799012zbMATH OpenOpenAlexFDO

Authors Chongwon Cho, Dana Dachman-Soled, Stanislaw Jarecki

Publication date 8 April 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-29485-8_10

Mathematics Subject Classification ID

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

Recommendations

• Fast 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
• Advances in Cryptology - EUROCRYPT 2004
• Efficient set intersection with simulation-based security
• Efficient parallel string comparison
• Concurrent secure computation with optimal query complexity
• An efficient toolkit for computing private set operations

Cited in

(7)

• On the gold standard for security of universal steganography
• Efficient covert two-party computation
• Oblivious key-value stores and amplification for private set intersection
• On the universal steganography of optimal rate
• On the round complexity of covert computation
• Short concurrent covert authenticated key exchange (short cAKE)
• Amortizing Circuit-PSI in the multiple sender/receiver setting

This page was built for publication: Efficient Concurrent Covert Computation of String Equality and Set Intersection

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