Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Cryptology

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Carmit Hazay, Yehuda Lindell

Published Nov 17, 2008• 98 citations
Publisher
DOI
10.1007/s00145-008-9034-x

Related papers

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Carmit Hazay, Yehuda Lindell

Springer eBooks•Feb 25, 2008•270 citations

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

Carmit Hazay, Tomas Toft

Lecture notes in computer science•Jan 1, 2010•75 citations

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Yonatan Aumann, Yehuda Lindell

Journal of Cryptology•Apr 6, 2009•206 citations

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Yonatan Aumann, Yehuda Lindell

Springer eBooks•May 16, 2007•212 citations

Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2013•148 citations

Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries

Yehuda Lindell

Journal of Cryptology•Feb 27, 2015•75 citations