I am
interested in computer security,
privacy and cryptography, and
in particular in the design of efficientsecurity systems
based on sound assumptions and solid proofs.
COPYRIGHT NOTICE:
Included are links to on-line
papers, to ensure timely dissemination on a noncommercial basis.
Copyright and all rights therein are maintained by the authors or by
other copyright holders, notwithstanding that they have offered their
works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by
the copyrights. These works may not be reposted without the explicit
permission of the copyright holder.
Moni
Naor, Benny Pinkas and Eyal Ronen How to (not) share a password: Privacy preserving
protocols for finding heavy hitters with adversarial behavior
ACM CCS '2019.
Available files: [ eprint
]
Phillipp Schoppmann, Adria
Gascon, Mariana Raykova and Benny Pinkas Make Some ROOM for the Zeros: Data Sparsity in Secure
Distributed Machine Learning ACM CCS '2019. [ eprint
]
Benny Pinkas, Mike Rosulek, Ni Trieu and Avishay Yanai
SpOT-Light: Lightweight
Private Set Intersection from Sparse OT Extension Crypto 2019. [ eprint
]
Benny Pinkas, Thomas
Schneider, Oleksandr Tkachenko and Avishay Yanai Efficient Circuit-based PSI with Linear Communication Eurocrypt 2019. [ eprint
]
Yehuda Lindell, Benny Pinkas, Nigel Smart and Avishay Yanai Efficient Constant-Round Computation Combining BMR and SPDZ Journal of Cryptology 2019. [ springer
] [ eprint
]
Amit Klein and Benny Pinkas DNS Cache-Based User Tracking The Network and Distributed Security Symposium
(NDSS) 2019. [ proceedings
]
Koji Chida, Koki Hamada, Dai
Ikarashi, Ryo Kikuchi, and Benny Pinkas High-Throughput Secure AES Computation Workshop on Encrypted Computing and Applied
Homomorphic Cryptography '2018
Available files: [ proccedings
]
Roi
Inbar, Eran Omri and Benny Pinkas Efficient Scalable Multiparty Private Set-Intersection
via Garbled Bloom Filters SCN '2018
Available files: [ Springer
]
Tore
Fredriksen, Yehuda Lindel, Valery Oshether and Benny Pinkas Fast Distributed RSA Key Generation for Semi-honest and
Malicious Adversaries Crypto '2018
Available files: [ eprint
] [ blog
]
Yossi
Adi, Carsten Baum, Moustapha Cissé, Benny Pinkas and Joseph Keshet Turning Your Weakness Into a Strength: Watermarking Deep
Neural Networks by Backdooring Usenix Security '2018
Available files: [ arxiv]
[ blog
] [ slides
and video ]
Benny
Pinkas, Thomas Schneider, Christian Weinet and Udi Wieder Efficient
Circuit-based PSI via Cuckoo Hashing Eurocrypt '2018
Available files: [ eprint ]
Yotam
Harchol, Ittai Abraham and Benny Pinkas Efficient
Distributed SSH Key Management with Proactive RSA Threshold Signatures ACNS '2018
Available files: [ eprint ]
Tore
Fredriksen, Benny Pinkas, and Avishay Yanai Committed
MPC - Maliciously Secure Multiparty Computation from Homomorphic
Commitments PKC '2018
Available files: [ eprint ]
Benny Pinkas, Thomas Schneider and Michael Zohner Scalable
Private Set Intersection Based on OT Extension
ACM Transactions on Privacy and Security 21(2):7:1-7:35(2018)
Available files: [ eprint
]
Vladimir
Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek and Ni Trieu Practical
Multi-party Private Set Intersection from Symmetric Key Techniques ACM CCS '2017 Available
files: [ eprint
]
Eyal Kolman
and and
Benny Pinkas Securely
Computing a Ground Speed Model ACM
TIST 8(4), 2017
Available files: [ journal
]
Niv Drucker, Shay
Gueron and Benny Pinkas Fasr
Secure Cloud Computations with a Trusted Proxy IEEE
Scurity and Privacy magazine 15(6): 61-67, 2017
Agnes Kiss,
Jian Liu, Thomas Schneider, N.
Asokan and Benny
Pinkas Private
Set Intersection for Unequal Set Sizes with Mobile Applications PoPETS
'2017 Available
files: [ eprint]
Sandeep
Tamrakar, Jian Liu, Andrew Paverd, Jan-Erik Ekberg, Benny Pinkas and N.
Asokan The
Circle Game: Scalable Private Membership Test Using Trusted Hardware Asia
CCS '2017 (recevied
an honorable
mention) Available
files: [ arxiv]
Ittai
Abraham, Christofpher W. Fletcher, Kartik
Nayak, Benny Pinkas and Ling Ren An
Oblivious RAM with Sub-logarithmic Bandwidth Blowup
PKC 2017
Available files: [ eprint
]
David
W. Archer, Dan Bogdanov, Benny Pinkas and Pille Pullonen Maturity
and Performance of Programmable Secure Computation
IEEE Security and Privacy Journal, Vol. 14, Issue 5, 2016.
Available files: [ eprint
]
Michael
Freedman, Carmit Hazay, Kobbi Nissim and Benny Pinkas Efficient
Set Intersection with Simulation-based Security
J. Cryptology 29(1):115-155 (2016).
Shay
Gueron, Yehuda Lindell, Ariel Nof and Benny Pinkas Fast
Garbling of Circuits Under Standard Assumptions
ACM CCS '2015 and J. Cryptology 31(3): 798-844 (2018)
Available files: [ eprint
]
Jian Liu,
N. Asokan and
Benny Pinkas Secure
Deduplication of Encrypted Data without Additional Independent Servers
ACM CCS '2015
Available files: [ eprint
]
Yehuda
Lindell, Benny Pinkas, Nigel Smart and Avishay Yanai Efficient
Constant Round Multi-party Computation Combining BMR and SPDZ
Crypto '2015
Available files: [ eprint
]
Benny
Pinkas, Thomas Schnedier, Gil Segev and Michael Zohner Phasing:
Private Set Intersection Using Permutation-based Hashing
Usenix Security '2015
Available files: [ eprint]
Benny Pinkas,
Thomas Schnedier and
Michael Zohner Private
Set Intersection based on OT Extension
Usenix Security '2014. Available files: [ eprint ]
Benny
Pinkas and Tzachy Reinman A
Simple Recursive Tree Oblivious RAM Available files: [ eprint ]
Arash Afshar,
Payman Mohassel, Benny
Pinkas, and Ben Riva Non-Interactive
Secure Computation Based on Cut-and-Choose
Eurocrypt '2014. Available files: [ slides
]
Ayman
Jarrous and Benny Pinkas Canon-MPC,
a system for casual non-interactive secure multi-party computation
using native client
Workshopon Privacy Enhancing Tchnologies (WPES) 2013.
Available files: [ pdf
]
Ayman Jarrous
and Benny Pinkas Secure
Computation of Functionalities based on Hamming Distance and its
Application to Computing Document Similarity
Interntional Journal
of Applied Cryptography
(IJACT) 3(1): 21-45 (2013).
Available files: [ pdf
]
Omer Berkman,
Benny Pinkas and Moti
Yung Firm
Grip Handshakes: a Tool for Bidirectional Vouching CANS
2012, December 2012.
Available files: [ pdf
]
Shai Halevi,
Danny Harnik, Benny Pinkas and Alexandra Shulman-Peleg Proofs of Ownership in Remote Storage Systems
Proceedings of the ACM Computer and Communications Security Conference
(ACM CCS), October 2011.
Available files: [ eprint
]
Yehuda Lindell,
Eli Oxman and Benny Pinkas The IPS Compiler: Optimizations, Variants and Concrete
Efficiency
Crypto 2011, August 14-18 2011, Santa Barbara, CA.
Available files: [ eprint
]
Shai Halevi,
Yehuda Lindell and Benny Pinkas Secure Computation on the Web: Computing without
Simultaneous Interaction
Crypto 2011, August 14-18 2011, Santa Barbara, CA.
Available files: [ eprint
]
Yehuda Lindell
and Benny Pinkas Secure Two-Party Computation via Cut-and-Choose Oblivious
Transfer
Theory of Cryptography Conference (TCC), March 2011, Providence, RI.
Available files: [ eprint
]
Marc Fischlin,
Benny Pinkas, Ahmad-Reza Sadeghi, Thomas Schneider and Ivan Visconti Secure Set Intersection with Untrusted Hardware Tokens
CT-RSA, February 2011, San Francisco, CA.
Available files: [ pdf
]
Moni Naor and
Benny Pinkas Efficient Trace and Revoke Schemes
International Journal of Information Security, Springer-Verlag, Vol. 9,
No. 6, pp. 40-47, 2010.
Benny Pinkas and
Tzachy Reinman Oblivious RAM Revisited
Crypto 2010, August 15-19 2010, Santa Barbara, CA.
Available files: [ eprint]
Mark Manulis,
Benny Pinkas and Bertram Poettering Privacy-Preserving Group Discovery with Linear Complexity
8th Intl. Conf. on Applied Cryptography and Network Security (ACNS
2010), June 22-25 2010, Beijing, China.
Margarita
Osadchy, Benny Pinkas, Ayman Jarrous and Boaz Moskovich SCiFI - A System for Secure Face Identification
(Received the best
paper award!)
31st IEEE Symposium on Security & Privacy, May 16-19, 2010,
Oakland, CA.
Available files: [ pdf, project and code
]
Gagan Aggarwal,
Nina Mishra and Benny Pinkas Secure Computation of the Median (and Other Elements of
Specified Ranks)
Journal of Cryptology, Vol. 23, No. 3, pp. 373-401. Online since
February 05, 2010.
Available files: [
Springer ]
Benny Pinkas, Thomas
Schneider, Nigel P. Smart and Stephen C. Williams Secure Two-Party Computation is Practical
ASIACRYPT 2009, December 6-10, 2009, Tokyo, Japan.
Available files: [
pdf ]
Ayman
Jarrous and Benny Pinkas Secure Hamming Distance
based Computation and its Applications
(Best student paper award!)
Proceedings of the International Conference
on Applied Cryptography and Network Security (ACNS),
June 2009.
Available files: [ pdf
]
Danny
Bickson, Tzachi Reinman, Danny Dolev and Benny Pinkas
Peer-to-Peer secure multi-party numerical computation facing malicious
adversaries
In Peer-to-Peer Networking and Applications (PPNA) journal, Springer,
May 2009.
Available files: [
pdf ]
Y.
Lindell and B. Pinkas Secure Multiparty Computation for
Privacy-Preserving Data Mining Journal of Privacy and Confidentiality, Vol. 1, No. 1,
pp. 59-98, 2009. Available
files: [ journal]
[ pdf] Y.
Lindell and B. Pinkas A Proof of Yao's
Protocol for Secure Two-Party Computation Journal
of Cryptology, 22(2):161-188, 2009.
Cryptology ePrint
Archive: Report 2004/175 (also appeared in ECCC).
Available files: [ PDF
] [ PS
] Assaf
Ben-David, Noam Nisan and Benny Pinkas
FairplayMP - A System for Secure Multi-Party Computation
Proceedings of the ACM Computer and Communications Security
Conference (ACM CCS), October 2008.
Available files: [
pdf, web
site ]
Yehuda
Lindell, Benny Pinkas and Nigel Smart Implementing two-party computation efficiently with security
against malicious adversaries
Proceedings of the Sixth
Conference on Security and Cryptography for Networks (SCN),
Amalfi, Italy, September 2008.
Available files: [ pdf
]
D. Bickson, D. Dolev, G. Bezman
and B. Pinkas Secure Multi-party Peer-to-Peer Numerical Computation
Proceedings of the 8th IEEE
Peer-to-Peer Computing (P2P'08), Sept. 2008, Aachen, Germany,
September 2008.
Available files: [ pdf
]
Leo
Dorrendorf, Zvi Gutterman and Benny Pinkas
Cryptanalysis of the Windows
Random Number Generator
Proceedings of the ACM Computer
and Communications Security Conference (ACM CCS), October
2007. Full
version in ACM Transactions on Information and System Security
(TISSEC), 13(1), 2009. Available
files: [ eprint
]
This paper received some publicity in the press (see Slashdot,
Computerworld, The
Register).
See also Microsoft's confirmation of a
similar problem in Windows XP Computerworld,
Slashdot,
The
Register.
Ronen Gradwohl, Moni Naor, Benny
Pinkas and Guy Rothblum
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions
of Sudoku Puzzles
Proc. of Fun
with Algorithms 2007,
LNCS 4475,
Springer-Verlag, pp. 166-182, June 2007.
Full version in Theory
of Computing Systems, Springer, Vol. 44, No. 2, pp.
245-268, February 2009.
Available files: [ proceedings
version, full version,
journal
version ] Y. Lindell and B. Pinkas An Efficient Protocol
for Secure Two-Party Computation in the Presence of Malicious
Adversaries Advances in
Cryptology -- Eurocrypt '2007 Proceedings, LNCS
4515, Springer-Verlag, pp. 52-78, May 2007.
Available files: [ pdf ]Z. Gutterman, B.
Pinkas and T. Reinman Analysis
of the Linux Random Number Generator The 2006 IEEE Symposium on Security and Privacy (Oakland
Conference), May 21-24, 2006.
Available files: [ eprint
]
M.
Naor and B. Pinkas Oblivious Polynomial Evaluation Siam Journal on Computing, Vol.
35, No. 5, 2006.
Available files:
[
SpringerLink ]
M.
Naor and B. Pinkas Computationally Secure Oblivious Transfer Journal of Cryptology, Vol. 18, No. 1, 2005.
Available files:
[
SpringerLink ]
M. Freedman, Y. Ishai,
B. Pinkas and O. Reingold Keyword Search and Oblivious Pseudorandom Functions
Proceedings of 2nd Theory of Cryptography Conference
(TCC '05) Cambridge, MA, Feb 2005.
Available files: [ PDF ]
[ PS ]
D.
Malkhi, N. Nisan, B.
Pinkas and Y. Sella Fairplay - A Secure Two-Party Computation System (Best
student paper award!)
Proceedings of Usenix Security '2004, August 9-13,
2004.
Available files: [ PDF ]
M. Freedman, K. Nissim and
B. Pinkas Efficient Private Matching and Set Intersection
Advances in Cryptology -- Eurocrypt '2004
Proceedings, LNCS 3027, Springer-Verlag, pp. 1-19, May 2004.
Available files: [ PDF
]
G. Aggarwal, N. Mishra and B. Pinkas Secure Computation of the K'th-ranked Element
Advances in Cryptology -- Eurocrypt '2004
Proceedings, LNCS 3027, Springer-Verlag, pp. 40-55, May 2004.
Available files: [ PDF ]
E.-J. Goh, D. Boneh, P.
Golle and B. Pinkas The Design and Implementation of Protocol-Based Hidden Key
Recovery
Proceedings of the 6th Information Security Conference (ISC'03),
LNCS 2851, Springer Verlag, October 2003.
Available files:
[ PDF ]
B.
Pinkas Fair Secure Two-Party Computation
Advances in Cryptology -- Eurocrypt '2003
Proceedings, LNCS 2656, Springer-Verlag, pp. 87-105, May 2003. B.
Pinkas Cryptographic Techniques for Privacy-Preserving Data Mining SIGKDD
Explorations, the newsletter of the ACM Special
Interest Group on Knowledge Discovery and Data Mining, January 2003.
Available files:
[ Postscript ] [ PDF ]
B. Pinkas and T. Sander Securing Passwords Against Dictionary Attacks
Proceedings of the ACM Computer and Communications Security
Conference, November 2002.
Available files:
[ Postscript ] [ PDF ] [
Slides ]
M.
Abadi, N. Glew, B. Horne and B. Pinkas Certified Email with a Light On-line Trusted Third Party:
Design and Implementation
Proceedings of WWW2002 (The eleventh International
World Wide Web Conference), May 2002.
Available files:
[ PDF ]
S. Haber and B. Pinkas Combining Public Key Cryptosystems
Proceedings of the ACM Computer and Security Conference,
November 2001.
Available files:
[ Postscript ]
B. Horne, B.
Pinkas and
T. Sander Escrow services and incentives in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce,
pp. 85-94, 2001. B. Pinkas Efficient State Updates for Key Management
Proceedings of the ACM Workshop on Security and Privacy in
Digital Rights Management, November 2001.
The full version appeared in the Proceedings of the IEEE,
Special Issue on Enabling Technologies for Digital Rights Management,
Vol. 92. No. 6, pp. 910-917, June 2004.
Available files (full version):
[ Postscript ]
[ PDF ]
M.
Naor and B. Pinkas Efficient Oblivious Transfer Protocols
Proceedings of SODA 2001 (SIAM Symposium on
Discrete Algorithms), January 7-9 2001.
Available files:
[ Postscript ]
M. Naor and B. Pinkas Distributed Oblivious Transfer
Advances in Cryptology -- Asiacrypt '00
Proceedings, LNCS 1976, Springer-Verlag, pp. 200-219, December 2000.
Available files:
[ Postscript ]
Y.
Lindell and B. Pinkas Privacy Preserving Data Mining
Advances in Cryptology -- Crypto '00 Proceedings,
LNCS 1880, Springer-Verlag, pp. 20-24, August 2000. A full version
appeared in the Journal of Cryptology, Volume 15 - Number 3, 2002.
Available files:
[ Postscript (conference)
] [ Postscript (full
version) ] [
PDF (full version) ]
M.
Naor and B. Pinkas Efficient Trace and Revoke Schemes
Proceedings of Financial Crypto '2000, Anguilla,
February 2000. The full version is now available.
Available files:
[ Postscript (full
version) ]
M. Naor,
B. Pinkas and R. Sumner Privacy Preserving Auctions and Mechanism Design
Proceedings of the 1st ACM conf. on Electronic Commerce,
November 1999.
Available files:
[ Postscript ] [ Presentation ]
M.
Naor and B. Pinkas Oblivious Transfer with Adaptive Queries
Advances in Cryptology - Crypto '99 Proceedings,
LNCS 1666, Springer-Verlag, pp. 573-590, August 1999.
Available files:
[ Postscript ]
V.
Anupam, A. Mayer, K. Nissim, B. Pinkas and M. Reiter On the Security of Pay-per-Click and Other Web Advertising
Schemes
Proc. of the 8th World Wide Web Conference, May
1999. (Computer Networks, Vol. 31, Issues 11--16,
1999, pp. 1091-1100).
Available files:
[ Postscript ]
[ HTML ]
M. Naor, B. Pinkas and O. Reingold Distributed Pseudo-Random Functions and KDCs
Advances in Cryptology - Eurocrypt '99 Proceedings,
LNCS 1592, Springer-Verlag, pp. 327-346, April 1999.
Available files:
[ Postscript ]
M.
Naor and B. Pinkas Oblivious Transfer and Polynomial Evaluation
Proc. of the 31st Symp. on Theory of Computer Science (STOC),
Atlanta, GA, pp. 245-254, May 1-4, 1999.
R.
Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor and B. Pinkas Multicast Security: A Taxonomy and Some Efficient Constructions
Proc. of INFOCOM '99, Vol. 2, pp. 708-716, New
York, NY, March 1999.
Available files:
[ Postscript ]
M.
Naor and B. Pinkas Threshold Traitor Tracing
Advances in Cryptology - Crypto '98 Proceedings,
LNCS 1462, Springer-Verlag, pp. 502-517, 1998.
Available files:
[ Postscript ]
B.
Chor, A. Fiat, M. Naor and B. Pinkas Tracing Traitors IEEE Transactions on Information Theory, Vol. 46,
No. 3, pp. 893-910, May 2000.
Available files:
[ Postscript ]
M.
Naor and B. Pinkas Secure and Efficient Metering
Advances in Cryptology - Eurocrypt '98 Proceedings,
Springer-Verlag, 1998.
Available files:
[ Postscript ]
M. Naor and B. Pinkas Secure Accounting and Auditing on the Web
Proc. of the 7th
World Wide Web Conference (Computer
Networks, Vol. 30, Issues 1-7, 1998, pp. 541-550).
Available files:
[ HTML ]
M. Naor and B.
Pinkas Visual Authentication and Identification
Advances in Cryptology - Crypto '97 Proceedings,
LNCS 1294, Springer-Verlag, pp. 322-336, 1997. A full version is
available.
Available files:
[ Postscript (proceedings)
] [ Postscript (full version)
]
and
here's an old one...
J. McInnes and B. Pinkas On the Impossibility of Private Key Cryptography with Weakly
Random Keys
Advances in Cryptology - Crypto '90 Proceedings,
LNCS 537, Springer-Verlag, pp. 421-435, 1990.
Internet Drafts and TRs:
R.
Canetti and B. Pinkas A taxonomy of multicast security issues
An updated version of internet draft draft-irtf-smug-taxonomy-00.txt>,
April 1999 (the original version was published in June 1998).
Available files: [
Text ]
R. Canetti, A. Herzberg and B. Pinkas Distributed Computing Simulator
TR #566, Dept. of Computer Science, Technion, June 1989.
See also my published patents
and patent
applications.