B
Benny Pinkas
Researcher at Bar-Ilan University
Publications - 156
Citations - 23468
Benny Pinkas is an academic researcher from Bar-Ilan University. The author has contributed to research in topics: Secure multi-party computation & Secure two-party computation. The author has an hindex of 64, co-authored 156 publications receiving 21122 citations. Previous affiliations of Benny Pinkas include Hebrew University of Jerusalem & VMware.
Papers
More filters
Proceedings ArticleDOI
Cryptanalysis of the windows random number generator
TL;DR: The pseudo-random number generator used by the Windows operating system is reconstructed, for the first time, and a on-trivial attack is found: given the internal state of the generator, the previous state can be computed in O(223) work, which can then be used to predict all random values used by a process in all its past and future operation.
Book ChapterDOI
Secure Hamming Distance Based Computation and Its Applications
Ayman Jarrous,Benny Pinkas +1 more
TL;DR: This paper presents protocols which are secure in the sense of full simulatability against malicious adversaries, including a protocol the authors call m -point-SPIR, which is an efficient variant of symmetric private information retrieval (SPIR).
Book ChapterDOI
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
TL;DR: In this paper, the authors present SPDZ in the two-party setting, where constant-round protocols exist that remain fast even over slow networks and all concretely efficient fully-secure protocols, such as SPDZ, require many rounds of communication.
Book ChapterDOI
On the Impossibility of Private Key Cryptography with Weakly Random Keys
James L. McInnes,Benny Pinkas +1 more
TL;DR: The present work begins to answer this question by establishing that a single weakly random source of either model cannot be used to obtain a secure "one-time-pad" type of cryptosystem.
Proceedings ArticleDOI
Fast Garbling of Circuits Under Standard Assumptions
TL;DR: This paper provides new methods for garbling that are secure solely under the assumption that the primitive used (e.g., AES) is a pseudorandom function.