Benny Pinkas

International Association for Cryptologic Research

Benny Pinkas Search web for home page

Program Committees

1	2019	PKC	pc
2	2019	Crypto	pc
3	2016	Crypto	pc
4	2014	PKC	pc
5	2011	Crypto	pc
6	2010	PKC	pc
7	2009	Crypto	pc
8	2009	PKC	pc
9	2006	PKC	pc
10	2005	Eurocrypt	pc
11	2003	Crypto	pc

Publications

	year	title	booktitle	pages
1	2018	Fast Garbling of Circuits Under Standard Assumptions	jofc	798-844
2	2018	Efficient Circuit-Based PSI via Cuckoo Hashing	eurocrypt	125-157
3	2018	Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries	crypto	331-361
4	2018	Committed MPC	pkc	587-619
5	2017	Asymptotically Tight Bounds for Composing ORAM with PIR	pkc	91-120
6	2016	Efficient Set Intersection with Simulation-Based Security	jofc	115-155
7	2015	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries	jofc	312-350
8	2015	Fast Garbling of Circuits Under Standard Assumptions	eprint	751
9	2015	Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ	eprint	523
10	2015	Maturity and Performance of Programmable Secure Computation	eprint	1039
11	2015	Secure Deduplication of Encrypted Data without Additional Independent Servers	eprint	455
12	2015	Non-Interactive Secure Computation Based on Cut-and-Choose	eprint	282
13	2015	Phasing: Private Set Intersection using Permutation-based Hashing	eprint	634
14	2015	Efficient Constant Round Multi-party Computation Combining BMR and SPDZ	crypto	online
15	2014	Non-Interactive Secure Computation Based on Cut-and-Choose	eurocrypt	online
16	2014	Faster Private Set Intersection based on OT Extension	eprint	447
17	2014	A Simple Recursive Tree Oblivious RAM	eprint	418
18	2011	Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer	tcc	online
19	2011	Secure Computation on the Web: Computing without Simultaneous Interaction	crypto	online
20	2011	The IPS Compiler: Optimizations, Variants and Concrete Efficiency	crypto	online
21	2010	Secure Computation of the Median (and Other Elements of Specified Ranks)	jofc	373-401
22	2010	Oblivious RAM Revisited	crypto	online
23	2010	Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer	eprint	online
24	2010	Oblivious RAM Revisited	eprint	online
25	2009	Secure Two-Party Computation Is Practical	asiacrypt	online
26	2009	A Proof of Security of Yao's Protocol for Two-Party Computation	jofc	161-188
27	2008	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries	eprint	online
28	2008	Secure Multiparty Computation for Privacy-Preserving Data Mining	eprint	online
29	2007	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries	eurocrypt	online
30	2007	Cryptanalysis of the Random Number Generator of the Windows Operating System	eprint	online
31	2006	Analysis of the Linux Random Number Generator	eprint	online
32	2005	Keyword Search and Oblivious Pseudorandom Functions	tcc	online
33	2005	Computationally Secure Oblivious Transfer	jofc	1-35
34	2004	Secure Computation of the k th-Ranked Element	eurocrypt	online
35	2004	Efficient Private Matching and Set Intersection	eurocrypt	online
36	2004	A Proof of Yao's Protocol for Secure Two-Party Computation	eprint	online
37	2003	Fair Secure Two-Party Computation	eurocrypt	online
38	2002	Privacy Preserving Data Mining	jofc	177-206
39	2000	Distributed Oblivious Transfer	asiacrypt	205-219
40	2000	Privacy Preserving Data Mining	crypto	online
41	1999	Oblivious Transfer with Adaptive Queries	crypto	573-590
42	1999	Distributed Pseudo-random Functions and KDCs	eurocrypt	327-346
43	1998	Threshold Traitor Tracing	crypto	502-517
44	1998	Secure and Efficient Metering	eurocrypt	576-590
45	1997	Visual Authentication and Identification	crypto	322-336
46	1997	Visual Authentication and Identification	eprint	online
47	1990	On the Impossibility of Private Key Cryptography with Weakly Random Keys	crypto	421-435

Benny Pinkas Search web for home page

Program Committees

Publications

Coauthors of Benny Pinkas