On the Impossibility of Private Key Cryptography with Weakly Random Keys. - James L. McInnes; Benny Pinkas (CRYPTO, 1990)

Visual Authentication and Identification. - Moni Naor; Benny Pinkas (IACR Cryptol. ePrint Arch., 1997)

Threshold Traitor Tracing. - Moni Naor; Benny Pinkas (CRYPTO, 1998)

Secure and Efficient Metering. - Moni Naor; Benny Pinkas (EUROCRYPT, 1998)

Secure Accounting and Auditing on the Web. - Moni Naor; Benny Pinkas (Comput. Networks, 1998)

Oblivious Transfer with Adaptive Queries. - Moni Naor; Benny Pinkas (CRYPTO, 1999)

Distributed Pseudo-random Functions and KDCs. - Moni Naor; Benny Pinkas; Omer Reingold (EUROCRYPT, 1999)

Multicast Security: A Taxonomy and Some Efficient Constructions. - Ran Canetti; Juan A. Garay; Gene Itkis; Daniele Micciancio; Moni Naor; Benny Pinkas (INFOCOM, 1999)

Privacy preserving auctions and mechanism design. - Moni Naor; Benny Pinkas; Reuban Sumner (EC, 1999)

Oblivious Transfer and Polynomial Evaluation. - Moni Naor; Benny Pinkas (STOC, 1999)

On the Security of Pay-per-Click and Other Web Advertising Schemes. - Vinod Anupam; Alain J. Mayer; Kobbi Nissim; Benny Pinkas; Michael K. Reiter (Comput. Networks, 1999)

Distributed Oblivious Transfer. - Moni Naor; Benny Pinkas (ASIACRYPT, 2000)

Tracing traitors. - Benny Chor; Amos Fiat; Moni Naor; Benny Pinkas (IEEE Trans. Inf. Theory, 2000)

Securely combining public-key cryptosystems. - Stuart Haber; Benny Pinkas (CCS, 2001)

Escrow services and incentives in peer-to-peer networks. - Bill G. Horne; Benny Pinkas; Tomas Sander (EC, 2001)

Efficient oblivious transfer protocols. - Moni Naor; Benny Pinkas (SODA, 2001)

Securing passwords against dictionary attacks. - Benny Pinkas; Tomas Sander (CCS, 2002)

Privacy Preserving Data Mining. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2002)

Cryptographic Techniques for Privacy-Preserving Data Mining. - Benny Pinkas (SIGKDD Explor., 2002)

Fair Secure Two-Party Computation. - Benny Pinkas (EUROCRYPT, 2003)

The Design and Implementation of Protocol-Based Hidden Key Recovery. - Eu-Jin Goh; Dan Boneh; Benny Pinkas; Philippe Golle (ISC, 2003)

Secure Computation of the k th-Ranked Element. - Gagan Aggarwal; Nina Mishra; Benny Pinkas (EUROCRYPT, 2004)

Efficient Private Matching and Set Intersection. - Michael J. Freedman; Kobbi Nissim; Benny Pinkas (EUROCRYPT, 2004)

Fairplay - Secure Two-Party Computation System. - Dahlia Malkhi; Noam Nisan; Benny Pinkas; Yaron Sella (USENIX Security Symposium, 2004)

A Proof of Yao's Protocol for Secure Two-Party Computation - Yehuda Lindell; Benny Pinkas (Electron. Colloquium Comput. Complex., 2004)

Efficient State Updates for Key Management. - Benny Pinkas (Proc. IEEE, 2004)

Keyword Search and Oblivious Pseudorandom Functions. - Michael J. Freedman; Yuval Ishai; Benny Pinkas; Omer Reingold (TCC, 2005)

Computationally Secure Oblivious Transfer. - Moni Naor; Benny Pinkas (J. Cryptol., 2005)

Traitor Tracing. - Benny Pinkas (Encyclopedia of Cryptography and Security, 2005)

Analysis of the Linux Random Number Generator. - Zvi Gutterman; Benny Pinkas; Tzachy Reinman (IACR Cryptol. ePrint Arch., 2006)

Oblivious Polynomial Evaluation. - Moni Naor; Benny Pinkas (SIAM J. Comput., 2006)

Cryptanalysis of the windows random number generator. - Leo Dorrendorf; Zvi Gutterman; Benny Pinkas (CCS, 2007)

FairplayMP: a system for secure multi-party computation. - Assaf Ben-David; Noam Nisan; Benny Pinkas (CCS, 2008)

Peer-to-Peer Secure Multi-party Numerical Computation. - Danny Bickson; Danny Dolev; Genia Bezman; Benny Pinkas (Peer-to-Peer Computing, 2008)

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. - Yehuda Lindell; Benny Pinkas; Nigel P. Smart (SCN, 2008)

Secure Hamming Distance Based Computation and Its Applications. - Ayman Jarrous; Benny Pinkas (ACNS, 2009)

Secure Two-Party Computation is Practical. - Benny Pinkas; Thomas Schneider 003; Nigel P. Smart; Stephen C. Williams (IACR Cryptol. ePrint Arch., 2009)

A Proof of Security of Yao's Protocol for Two-Party Computation. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2009)

Secure Multiparty Computation for Privacy-Preserving Data Mining. - Yehuda Lindell; Benny Pinkas (J. Priv. Confidentiality, 2009)

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. - Ronen Gradwohl; Moni Naor; Benny Pinkas; Guy N. Rothblum (Theory Comput. Syst., 2009)

Cryptanalysis of the random number generator of the Windows operating system. - Leo Dorrendorf; Zvi Gutterman; Benny Pinkas (ACM Trans. Inf. Syst. Secur., 2009)

Privacy-Preserving Group Discovery with Linear Complexity. - Mark Manulis; Benny Pinkas; Bertram Poettering (ACNS, 2010)

SCiFI - A System for Secure Face Identification. - Margarita Osadchy; Benny Pinkas; Ayman Jarrous; Boaz Moskovich (IEEE Symposium on Security and Privacy, 2010)

Oblivious RAM Revisited. - Benny Pinkas; Tzachy Reinman (IACR Cryptol. ePrint Arch., 2010)

Side Channels in Cloud Services: Deduplication in Cloud Storage. - Danny Harnik; Benny Pinkas; Alexandra Shulman-Peleg (IEEE Secur. Priv., 2010)

Efficient trace and revoke schemes. - Moni Naor; Benny Pinkas (Int. J. Inf. Sec., 2010)

Secure Computation of the Median (and Other Elements of Specified Ranks). - Gagan Aggarwal; Nina Mishra; Benny Pinkas (J. Cryptol., 2010)

Peer-to-peer secure multi-party numerical computation facing malicious adversaries. - Danny Bickson; Tzachy Reinman; Danny Dolev; Benny Pinkas (Peer-to-Peer Netw. Appl., 2010)

Secure Set Intersection with Untrusted Hardware Tokens. - Marc Fischlin; Benny Pinkas; Ahmad-Reza Sadeghi; Thomas Schneider 003; Ivan Visconti (CT-RSA, 2011)

Secure Computing in the Cloud (Dagstuhl Seminar 11491). - Benny Pinkas; Ahmad-Reza Sadeghi; Nigel P. Smart (Dagstuhl Reports, 2011)

Proofs of Ownership in Remote Storage Systems. - Shai Halevi; Danny Harnik; Benny Pinkas; Alexandra Shulman-Peleg (IACR Cryptol. ePrint Arch., 2011)

Secure Computation on the Web: Computing without Simultaneous Interaction. - Shai Halevi; Yehuda Lindell; Benny Pinkas (IACR Cryptol. ePrint Arch., 2011)

The IPS Compiler: Optimizations, Variants and Concrete Efficiency. - Yehuda Lindell; Benny Pinkas; Eli Oxman (IACR Cryptol. ePrint Arch., 2011)

Traitor Tracing. - Benny Pinkas (Encyclopedia of Cryptography and Security (2nd Ed.), 2011)

Firm Grip Handshakes: A Tool for Bidirectional Vouching. - Omer Berkman; Benny Pinkas; Moti Yung (CANS, 2012)

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2012)

Canon-MPC, a system for casual non-interactive secure multi-party computation using native client. - Ayman Jarrous; Benny Pinkas (WPES, 2013)

Secure computation of functionalities based on Hamming distance and its application to computing document similarity. - Ayman Jarrous; Benny Pinkas (Int. J. Appl. Cryptogr., 2013)

Faster Private Set Intersection based on OT Extension. - Benny Pinkas; Thomas Schneider 003; Michael Zohner (IACR Cryptol. ePrint Arch., 2014)

A Simple Recursive Tree Oblivious RAM. - Benny Pinkas; Tzachy Reinman (IACR Cryptol. ePrint Arch., 2014)

Non-Interactive Secure Computation Based on Cut-and-Choose. - Arash Afshar; Payman Mohassel; Benny Pinkas; Ben Riva (IACR Cryptol. ePrint Arch., 2015)

Secure Deduplication of Encrypted Data without Additional Independent Servers. - Jian Liu 012; N. Asokan; Benny Pinkas (IACR Cryptol. ePrint Arch., 2015)

Phasing: Private Set Intersection using Permutation-based Hashing. - Benny Pinkas; Thomas Schneider 003; Gil Segev 001; Michael Zohner (IACR Cryptol. ePrint Arch., 2015)

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. - Yehuda Lindell; Benny Pinkas (J. Cryptol., 2015)

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup. - Kartik Nayak; Ling Ren 001; Ittai Abraham; Benny Pinkas (IACR Cryptol. ePrint Arch., 2016)

Maturity and Performance of Programmable Secure Computation. - David W. Archer; Dan Bogdanov; Benny Pinkas; Pille Pullonen (IEEE Secur. Priv., 2016)

Efficient Set Intersection with Simulation-Based Security. - Michael J. Freedman; Carmit Hazay; Kobbi Nissim; Benny Pinkas (J. Cryptol., 2016)

The Circle Game: Scalable Private Membership Test Using Trusted Hardware. - Sandeep Tamrakar; Jian Liu 012; Andrew Paverd; Jan-Erik Ekberg; Benny Pinkas; N. Asokan (AsiaCCS, 2017)

Asymptotically Tight Bounds for Composing ORAM with PIR. - Ittai Abraham; Christopher W. Fletcher; Kartik Nayak; Benny Pinkas; Ling Ren 001 (Public Key Cryptography (1), 2017)

Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. - Tore Kasper Frederiksen; Benny Pinkas; Avishay Yanai (IACR Cryptol. ePrint Arch., 2017)

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. - Vladimir Kolesnikov; Naor Matania; Benny Pinkas; Mike Rosulek; Ni Trieu (IACR Cryptol. ePrint Arch., 2017)

Faster Secure Cloud Computations with a Trusted Proxy. - Nir Drucker; Shay Gueron; Benny Pinkas (IEEE Secur. Priv., 2017)

Private Set Intersection for Unequal Set Sizes with Mobile Applications. - Ágnes Kiss; Jian Liu 012; Thomas Schneider 003; N. Asokan; Benny Pinkas (Proc. Priv. Enhancing Technol., 2017)

Securely Computing a Ground Speed Model. - Eyal Kolman; Benny Pinkas (ACM Trans. Intell. Syst. Technol., 2017)

High-Throughput Secure AES Computation. - Koji Chida; Koki Hamada; Dai Ikarashi; Ryo Kikuchi; Benny Pinkas (WAHC@CCS, 2018)

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters. - Roi Inbar; Eran Omri; Benny Pinkas (SCN, 2018)

Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring. - Yossi Adi; Carsten Baum; Moustapha Cissé; Benny Pinkas; Joseph Keshet (USENIX Security Symposium, 2018)

Adversarial Examples on Discrete Sequences for Beating Whole-Binary Malware Detection. - Felix Kreuk; Assi Barak; Shir Aviv-Reuven; Moran Baruch; Benny Pinkas; Joseph Keshet (CoRR, 2018)

SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains. - Guy Golan-Gueta; Ittai Abraham; Shelly Grossman; Dahlia Malkhi; Benny Pinkas; Michael K. Reiter; Dragos-Adrian Seredinschi; Orr Tamir; Alin Tomescu (CoRR, 2018)

Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries. - Tore Kasper Frederiksen; Yehuda Lindell; Valery Osheter; Benny Pinkas (IACR Cryptol. ePrint Arch., 2018)

Distributed SSH Key Management with Proactive RSA Threshold Signatures. - Yotam Harchol; Ittai Abraham; Benny Pinkas (IACR Cryptol. ePrint Arch., 2018)

How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior. - Moni Naor; Benny Pinkas; Eyal Ronen (IACR Cryptol. ePrint Arch., 2018)

Efficient Circuit-based PSI via Cuckoo Hashing. - Benny Pinkas; Thomas Schneider 003; Christian Weinert; Udi Wieder (IACR Cryptol. ePrint Arch., 2018)

Fast Garbling of Circuits Under Standard Assumptions. - Shay Gueron; Yehuda Lindell; Ariel Nof; Benny Pinkas (J. Cryptol., 2018)

Scalable Private Set Intersection Based on OT Extension. - Benny Pinkas; Thomas Schneider 003; Michael Zohner (ACM Trans. Priv. Secur., 2018)

SBFT: A Scalable and Decentralized Trust Infrastructure. - Guy Golan-Gueta; Ittai Abraham; Shelly Grossman; Dahlia Malkhi; Benny Pinkas; Michael K. Reiter; Dragos-Adrian Seredinschi; Orr Tamir; Alin Tomescu (DSN, 2019)

DNS Cache-Based User Tracking. - Amit Klein 001; Benny Pinkas (NDSS, 2019)

From IP ID to Device ID and KASLR Bypass. - Amit Klein 001; Benny Pinkas (USENIX Security Symposium, 2019)

From IP ID to Device ID and KASLR Bypass (Extended Version). - Amit Klein 001; Benny Pinkas (CoRR, 2019)

An Efficient Secure Three-Party Sorting Protocol with an Honest Majority. - Koji Chida; Koki Hamada; Dai Ikarashi; Ryo Kikuchi; Naoto Kiribuchi; Benny Pinkas (IACR Cryptol. ePrint Arch., 2019)

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. - Benny Pinkas; Mike Rosulek; Ni Trieu; Avishay Yanai (IACR Cryptol. ePrint Arch., 2019)

Efficient Circuit-based PSI with Linear Communication. - Benny Pinkas; Thomas Schneider 003; Oleksandr Tkachenko; Avishay Yanai (IACR Cryptol. ePrint Arch., 2019)

Make Some ROOM for the Zeros: Data Sparsity in Secure Distributed Machine Learning. - Phillipp Schoppmann; Adrià Gascón; Mariana Raykova 001; Benny Pinkas (IACR Cryptol. ePrint Arch., 2019)

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ. - Yehuda Lindell; Benny Pinkas; Nigel P. Smart; Avishay Yanai (J. Cryptol., 2019)

Blinder - Scalable, Robust Anonymous Committed Broadcast. - Ittai Abraham; Benny Pinkas; Avishay Yanai (CCS, 2020)

Flaw Label: Exploiting IPv6 Flow Label. - Jonathan Berger; Amit Klein 001; Benny Pinkas (SP, 2020)

Towards Scalable Threshold Cryptosystems. - Alin Tomescu; Robert Chen; Yiming Zheng; Ittai Abraham; Benny Pinkas; Guy Golan-Gueta; Srinivas Devadas (SP, 2020)

Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast. - Ittai Abraham; Benny Pinkas; Avishay Yanai (IACR Cryptol. ePrint Arch., 2020)

PEM: Privacy-preserving Epidemiological Modeling. - Marco Holz; Benjamin Judkewitz; Helen Möllering; Benny Pinkas; Thomas Schneider 003 (IACR Cryptol. ePrint Arch., 2020)

PSI from PaXoS: Fast, Malicious Private Set Intersection. - Benny Pinkas; Mike Rosulek; Ni Trieu; Avishay Yanai (IACR Cryptol. ePrint Arch., 2020)

Fairness in the Eyes of the Data: Certifying Machine-Learning Models. - Shahar Segal; Yossi Adi; Benny Pinkas; Carsten Baum; Chaya Ganesh; Joseph Keshet (AIES, 2021)

Secure Graph Analysis at Scale. - Toshinori Araki; Jun Furukawa 001; Kazuma Ohara; Benny Pinkas; Hanan Rosemarin; Hikaru Tsuchida 001 (CCS, 2021)

Oblivious Key-Value Stores and Amplification for Private Set Intersection. - Gayathri Garimella; Benny Pinkas; Mike Rosulek; Ni Trieu; Avishay Yanai (IACR Cryptol. ePrint Arch., 2021)

GPU-accelerated PIR with Client-Independent Preprocessing for Large-Scale Applications. - Daniel Günther 004; Maurice Heymann; Benny Pinkas; Thomas Schneider 003 (IACR Cryptol. ePrint Arch., 2021)

Poster: Privacy-Preserving Epidemiological Modeling on Mobile Graphs. - Daniel Günther 004; Marco Holz; Benjamin Judkewitz; Helen Möllering; Benny Pinkas; Thomas Schneider 003; Ajith Suresh (CCS, 2022)

ScionFL: Secure Quantized Aggregation for Federated Learning. - Yaniv Ben-Itzhak; Helen Möllering; Benny Pinkas; Thomas Schneider 003; Ajith Suresh; Oleksandr Tkachenko; Shay Vargaftik; Christian Weinert; Hossein Yalame; Avishay Yanai (CoRR, 2022)

Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. - Gilad Asharov; Koki Hamada; Dai Ikarashi; Ryo Kikuchi; Ariel Nof; Benny Pinkas; Katsumi Takahashi; Junichi Tomida (IACR Cryptol. ePrint Arch., 2022)

UTT: Decentralized Ecash with Accountable Privacy. - Alin Tomescu; Adithya Bhat; Benny Applebaum; Ittai Abraham; Guy Gueta; Benny Pinkas; Avishay Yanai (IACR Cryptol. ePrint Arch., 2022)

Secure Statistical Analysis on Multiple Datasets: Join and Group-By. - Gilad Asharov; Koki Hamada; Ryo Kikuchi; Ariel Nof; Benny Pinkas; Junichi Tomida (CCS, 2023)

How to Recover a Secret with $O(n)$ Additions. - Benny Applebaum; Oded Nir; Benny Pinkas (Electron. Colloquium Comput. Complex., 2023)

ScionFL: Efficient and Robust Secure Quantized Aggregation. - Yaniv Ben-Itzhak; Helen Möllering; Benny Pinkas; Thomas Schneider 003; Ajith Suresh; Oleksandr Tkachenko; Shay Vargaftik; Christian Weinert; Hossein Yalame; Avishay Yanai (IACR Cryptol. ePrint Arch., 2023)

A New Paradigm for Verifiable Secret Sharing. - Sourav Das 001; Zhuolun Xiang; Alin Tomescu; Alexander Spiegelman; Benny Pinkas; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2023)

Efficiently-Thresholdizable Batched Identity Based Encryption, with Applications. - Amit Agarwal; Rex Fernando; Benny Pinkas (IACR Cryptol. ePrint Arch., 2024)

Distributing Keys and Random Secrets with Constant Complexity. - Benny Applebaum; Benny Pinkas (IACR Cryptol. ePrint Arch., 2024)

Secure Statistical Analysis on Multiple Datasets: Join and Group-By. - Gilad Asharov; Koki Hamada; Dai Ikarashi; Ryo Kikuchi; Ariel Nof; Benny Pinkas; Junichi Tomida (IACR Cryptol. ePrint Arch., 2024)

Distributed Randomness using Weighted VRFs. - Sourav Das 001; Benny Pinkas; Alin Tomescu; Zhuolun Xiang (IACR Cryptol. ePrint Arch., 2024)

Distributed Randomness Using Weighted VUFs. - Sourav Das 001; Benny Pinkas; Alin Tomescu; Zhuolun Xiang (EUROCRYPT (7), 2025)

Verifiable Secret Sharing Simplified. - Sourav Das 001; Zhuolun Xiang; Alin Tomescu; Alexander Spiegelman; Benny Pinkas; Ling Ren 001 (SP, 2025)

Privacy-Preserving Epidemiological Modeling on Mobile Graphs. - Daniel Günther 004; Marco Holz; Benjamin Judkewitz; Helen Möllering; Benny Pinkas; Thomas Schneider 003; Ajith Suresh (IEEE Trans. Inf. Forensics Secur., 2025)