Benny Pinkas

According to our database1, Benny Pinkas authored at least 132 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ.
J. Cryptology, 2019

Make Some ROOM for the Zeros: Data Sparsity in Secure Distributed Machine Learning.
IACR Cryptology ePrint Archive, 2019

Efficient Circuit-based PSI with Linear Communication.
IACR Cryptology ePrint Archive, 2019

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension.
IACR Cryptology ePrint Archive, 2019

An Efficient Secure Three-Party Sorting Protocol with an Honest Majority.
IACR Cryptology ePrint Archive, 2019

From IP ID to Device ID and KASLR Bypass (Extended Version).
CoRR, 2019

From IP ID to Device ID and KASLR Bypass.
Proceedings of the 28th USENIX Security Symposium, 2019

DNS Cache-Based User Tracking.
Proceedings of the 26th Annual Network and Distributed System Security Symposium, 2019

Efficient Circuit-Based PSI with Linear Communication.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

SBFT: A Scalable and Decentralized Trust Infrastructure.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Scalable Private Set Intersection Based on OT Extension.
ACM Trans. Priv. Secur., 2018

Fast Garbling of Circuits Under Standard Assumptions.
J. Cryptology, 2018

Efficient Circuit-based PSI via Cuckoo Hashing.
IACR Cryptology ePrint Archive, 2018

How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior.
IACR Cryptology ePrint Archive, 2018

Distributed SSH Key Management with Proactive RSA Threshold Signatures.
IACR Cryptology ePrint Archive, 2018

Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries.
IACR Cryptology ePrint Archive, 2018

SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains.
CoRR, 2018

Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring.
CoRR, 2018

Adversarial Examples on Discrete Sequences for Beating Whole-Binary Malware Detection.
CoRR, 2018

Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring.
Proceedings of the 27th USENIX Security Symposium, 2018

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Efficient Circuit-Based PSI via Cuckoo Hashing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

High-Throughput Secure AES Computation.
Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2018

Distributed SSH Key Management with Proactive RSA Threshold Signatures.
Proceedings of the Applied Cryptography and Network Security, 2018

2017
Securely Computing a Ground Speed Model.
ACM TIST, 2017

Private Set Intersection for Unequal Set Sizes with Mobile Applications.
PoPETs, 2017

Faster Secure Cloud Computations with a Trusted Proxy.
IEEE Security & Privacy, 2017

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques.
IACR Cryptology ePrint Archive, 2017

Private Set Intersection for Unequal Set Sizes with Mobile Applications.
IACR Cryptology ePrint Archive, 2017

Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments.
IACR Cryptology ePrint Archive, 2017

Asymptotically Tight Bounds for Composing ORAM with PIR.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

The Circle Game: Scalable Private Membership Test Using Trusted Hardware.
Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, 2017

Practical Multi-party Private Set Intersection from Symmetric-Key Techniques.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

2016
Efficient Set Intersection with Simulation-Based Security.
J. Cryptology, 2016

Maturity and Performance of Programmable Secure Computation.
IEEE Security & Privacy, 2016

Scalable Private Set Intersection Based on OT Extension.
IACR Cryptology ePrint Archive, 2016

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup.
IACR Cryptology ePrint Archive, 2016

The Circle Game: Scalable Private Membership Test Using Trusted Hardware.
CoRR, 2016

2015
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
J. Cryptology, 2015

Phasing: Private Set Intersection using Permutation-based Hashing.
IACR Cryptology ePrint Archive, 2015

Secure Deduplication of Encrypted Data without Additional Independent Servers.
IACR Cryptology ePrint Archive, 2015

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ.
IACR Cryptology ePrint Archive, 2015

Fast Garbling of Circuits Under Standard Assumptions.
IACR Cryptology ePrint Archive, 2015

Maturity and Performance of Programmable Secure Computation.
IACR Cryptology ePrint Archive, 2015

Non-Interactive Secure Computation Based on Cut-and-Choose.
IACR Cryptology ePrint Archive, 2015

Phasing: Private Set Intersection Using Permutation-based Hashing.
Proceedings of the 24th USENIX Security Symposium, 2015

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secure Deduplication of Encrypted Data without Additional Independent Servers.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Fast Garbling of Circuits Under Standard Assumptions.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
A Simple Recursive Tree Oblivious RAM.
IACR Cryptology ePrint Archive, 2014

Faster Private Set Intersection based on OT Extension.
IACR Cryptology ePrint Archive, 2014

Faster Private Set Intersection Based on OT Extension.
Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

Non-Interactive Secure Computation Based on Cut-and-Choose.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Secure computation of functionalities based on Hamming distance and its application to computing document similarity.
IJACT, 2013

Canon-MPC, a system for casual non-interactive secure multi-party computation using native client.
Proceedings of the 12th annual ACM Workshop on Privacy in the Electronic Society, 2013

2012
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
J. Cryptology, 2012

Firm Grip Handshakes: A Tool for Bidirectional Vouching.
Proceedings of the Cryptology and Network Security, 11th International Conference, 2012

2011
The IPS Compiler: Optimizations, Variants and Concrete Efficiency.
IACR Cryptology ePrint Archive, 2011

Secure Computation on the Web: Computing without Simultaneous Interaction.
IACR Cryptology ePrint Archive, 2011

Proofs of Ownership in Remote Storage Systems.
IACR Cryptology ePrint Archive, 2011

Secure Computing in the Cloud (Dagstuhl Seminar 11491).
Dagstuhl Reports, 2011

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Secure Set Intersection with Untrusted Hardware Tokens.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

The IPS Compiler: Optimizations, Variants and Concrete Efficiency.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Secure Computation on the Web: Computing without Simultaneous Interaction.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Proofs of ownership in remote storage systems.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2010
Peer-to-peer secure multi-party numerical computation facing malicious adversaries.
Peer-to-Peer Networking and Applications, 2010

Secure Computation of the Median (and Other Elements of Specified Ranks).
J. Cryptology, 2010

Efficient trace and revoke schemes.
Int. J. Inf. Sec., 2010

Side Channels in Cloud Services: Deduplication in Cloud Storage.
IEEE Security & Privacy, 2010

Oblivious RAM Revisited.
IACR Cryptology ePrint Archive, 2010

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.
IACR Cryptology ePrint Archive, 2010

SCiFI - A System for Secure Face Identification.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

Oblivious RAM Revisited.
Proceedings of the Advances in Cryptology, 2010

Privacy-Preserving Group Discovery with Linear Complexity.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Cryptanalysis of the random number generator of the Windows operating system.
ACM Trans. Inf. Syst. Secur., 2009

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.
Theory Comput. Syst., 2009

A Proof of Security of Yao's Protocol for Two-Party Computation.
J. Cryptology, 2009

Secure Two-Party Computation is Practical.
IACR Cryptology ePrint Archive, 2009

Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries
CoRR, 2009

Secure Two-Party Computation Is Practical.
Proceedings of the Advances in Cryptology, 2009

Secure Hamming Distance Based Computation and Its Applications.
Proceedings of the Applied Cryptography and Network Security, 7th International Conference, 2009

2008
Secure Multiparty Computation for Privacy-Preserving Data Mining.
IACR Cryptology ePrint Archive, 2008

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
IACR Cryptology ePrint Archive, 2008

Peer-to-Peer Secure Multi-Party Numerical Computation
CoRR, 2008

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Peer-to-Peer Secure Multi-party Numerical Computation.
Proceedings of the Proceedings P2P'08, 2008

FairplayMP: a system for secure multi-party computation.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
Cryptanalysis of the Random Number Generator of the Windows Operating System.
IACR Cryptology ePrint Archive, 2007

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.
Proceedings of the Advances in Cryptology, 2007

Cryptanalysis of the windows random number generator.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

2006
Oblivious Polynomial Evaluation.
SIAM J. Comput., 2006

Analysis of the Linux Random Number Generator.
IACR Cryptology ePrint Archive, 2006

Analysis of the Linux Random Number Generator.
Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006

2005
Traitor Tracing.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Computationally Secure Oblivious Transfer.
J. Cryptology, 2005

Keyword Search and Oblivious Pseudorandom Functions.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

2004
Efficient State Updates for Key Management.
Proceedings of the IEEE, 2004

A Proof of Yao's Protocol for Secure Two-Party Computation.
IACR Cryptology ePrint Archive, 2004

A Proof of Yao's Protocol for Secure Two-Party Computation
Electronic Colloquium on Computational Complexity (ECCC), 2004

Fairplay - Secure Two-Party Computation System.
Proceedings of the 13th USENIX Security Symposium, August 9-13, 2004, San Diego, CA, USA, 2004

Efficient Private Matching and Set Intersection.
Proceedings of the Advances in Cryptology, 2004

Secure Computation of the k th-Ranked Element.
Proceedings of the Advances in Cryptology, 2004

2003
The Design and Implementation of Protocol-Based Hidden Key Recovery.
Proceedings of the Information Security, 6th International Conference, 2003

Fair Secure Two-Party Computation.
Proceedings of the Advances in Cryptology, 2003

2002
Cryptographic Techniques for Privacy-Preserving Data Mining.
SIGKDD Explorations, 2002

Privacy Preserving Data Mining.
J. Cryptology, 2002

Securing passwords against dictionary attacks.
Proceedings of the 9th ACM Conference on Computer and Communications Security, 2002

2001
Efficient oblivious transfer protocols.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Escrow services and incentives in peer-to-peer networks.
Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001

Efficient State Updates for Key Management.
Proceedings of the Security and Privacy in Digital Rights Management, 2001

Securely combining public-key cryptosystems.
Proceedings of the CCS 2001, 2001

2000
Tracing traitors.
IEEE Trans. Information Theory, 2000

Efficient Trace and Revoke Schemes.
Proceedings of the Financial Cryptography, 2000

Privacy Preserving Data Mining.
Proceedings of the Advances in Cryptology, 2000

Distributed Oblivious Transfer.
Proceedings of the Advances in Cryptology, 2000

1999
On the Security of Pay-per-Click and Other Web Advertising Schemes.
Computer Networks, 1999

Oblivious Transfer and Polynomial Evaluation.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Privacy preserving auctions and mechanism design.
Proceedings of the First ACM Conference on Electronic Commerce (EC-99), 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Distributed Pseudo-random Functions and KDCs.
Proceedings of the Advances in Cryptology, 1999

Oblivious Transfer with Adaptive Queries.
Proceedings of the Advances in Cryptology, 1999

1998
Secure Accounting and Auditing on the Web.
Computer Networks, 1998

Secure and Efficient Metering.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Threshold Traitor Tracing.
Proceedings of the Advances in Cryptology, 1998

1997
Visual Authentication and Identification.
IACR Cryptology ePrint Archive, 1997

Visual Authentication and Identification.
Proceedings of the Advances in Cryptology, 1997

1990
On the Impossibility of Private Key Cryptography with Weakly Random Keys.
Proceedings of the Advances in Cryptology, 1990


  Loading...