Yehuda Lindell

International Association for Cryptologic Research

Yehuda Lindell Search web for home page

Program Committees

1	2012	Eurocrypt	pc
2	2011	PKC	pc
3	2010	Crypto	pc
4	2008	TCC	pc
5	2008	Crypto	pc
6	2006	Crypto	pc
7	2006	TCC	pc
8	2005	Crypto	pc
9	2004	Eurocrypt	pc

Publications

	year	title	booktitle	pages
1	2012	Completeness for Symmetric Two-Party Functionalities - Revisited	asiacrypt	116-133
2	2011	Secure Computation on the Web: Computing without Simultaneous Interaction	crypto	128
3	2011	Perfectly-Secure Multiplication for any $t	crypto	237
4	2011	The IPS Compiler: Optimizations, Variants and Concrete Efficiency	crypto	255
5	2011	$1/p$-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds	crypto	273
6	2011	Highly-Efficient Universally-Composable Commitments based on the DDH Assumption	eurocrypt	446
7	2011	Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer	jofc	761-799
8	2011	Secure Computation Without Authentication	jofc	720-760
9	2011	Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs	jofc	517-544
10	2011	Utility Dependence in Correct and Fair Rational Secret Sharing	jofc	157-202
11	2011	Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer	tcc	329
12	2011	On the Black-Box Complexity of Optimally-Fair Coin Tossing	tcc	450
13	2010	Black-Box Constructions of Protocols for Secure Computation	eprint	online
14	2010	Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries	jofc	422-456
15	2010	Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer	eprint	online
16	2010	On Achieving the "Best of Both Worlds" in Secure Multiparty Computation	eprint	online
17	2010	Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries	jofc	281-343
18	2009	Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1	eprint	online
19	2009	Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries	eprint	online
20	2009	Constructions of Truly Practical Secure Protocols using Standard Smartcards	eprint	online
21	2009	Adaptively Secure Two-Party Computation with Erasures	eprint	online
22	2009	Collusion-Free Multiparty Computation in the Mediated Model	crypto	524-540
23	2009	Utility Dependence in Correct and Fair Rational Secret Sharing	crypto	559-576
24	2009	A Proof of Security of Yao's Protocol for Two-Party Computation	jofc	161-188
25	2009	General Composition and Universal Composability in Secure Multiparty Computation	jofc	395-428
26	2009	Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer	tcc	183-201
27	2008	Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs	jofc	303-349
28	2008	Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries	tcc	155-175
29	2008	Efficient Fully-Simulatable Oblivious Transfer	eprint	online
30	2008	Lower Bounds and Impossibility Results for Concurrent Self Composition	jofc	200-249
31	2008	Complete Fairness in Secure Two-Party Computation	eprint	online
32	2008	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries	eprint	online
33	2008	Collusion-Free Multiparty Computation in the Mediated Model	eprint	online
34	2008	Secure Multiparty Computation for Privacy-Preserving Data Mining	eprint	online
35	2007	Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries	eprint	online
36	2007	An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries	eurocrypt	52-78
37	2007	Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries	tcc	137-156
38	2007	Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions	tcc	323-341
39	2007	Secure Computation Without Authentication	eprint	online
40	2006	Session-Key Generation Using Human Passwords Only	jofc	241-340
41	2006	On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions	jofc	135-167
42	2006	On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation	crypto	online
43	2006	A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions	jofc	359-377
44	2005	Secure Multi-Party Computation without Agreement	jofc	247-287
45	2005	Concurrent Composition of Secure Protocols in the Timing Model	eprint	online
46	2005	Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs	tcc	online
47	2005	Universally Composable Password-Based Key Exchange	eurocrypt	online
48	2005	Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs	eprint	online
49	2005	Secure Computation Without Authentication	crypto	online
50	2005	Universally Composable Password-Based Key Exchange	eprint	online
51	2004	Lower Bounds for Concurrent Self Composition	tcc	203-222
52	2004	On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions	eprint	online
53	2004	A Proof of Yao's Protocol for Secure Two-Party Computation	eprint	online
54	2004	On the Composition of Authenticated Byzantine Agreement	eprint	online
55	2004	Lower Bounds for Non-Black-Box Zero Knowledge	eprint	online
56	2004	Protocol Initialization for the Framework of Universal Composability	eprint	online
57	2004	Lower Bounds and Impossibility Results for Concurrent Self Composition	eprint	online
58	2003	A Framework for Password-Based Authenticated Key Exchange	eurocrypt	online
59	2003	A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions	eurocrypt	online
60	2003	Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model	eprint	online
61	2003	General Composition and Universal Composability in Secure Multiparty Computation	eprint	online
62	2003	Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation	jofc	143-184
63	2003	On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions	eurocrypt	online
64	2003	A Framework for Password-Based Authenticated Key Exchange	eprint	online
65	2002	Secure Computation Without Agreement	eprint	online
66	2002	Strict Polynomial-time in Simulation and Extraction	eprint	online
67	2002	A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions	eprint	online
68	2002	Universally Composable Two-Party and Multi-Party Secure Computation	eprint	online
69	2002	Privacy Preserving Data Mining	jofc	177-206
70	2001	Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation	crypto	171-189
71	2001	Session-Key Generation Using Human Passwords Only	crypto	408-432
72	2001	Resettably-Sound Zero-Knowledge and its Applications	eprint	online
73	2001	Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation	eprint	online
74	2000	Privacy Preserving Data Mining	crypto	36-54
75	2000	Session-Key Generation using Human Passwords Only	eprint	online

Yehuda Lindell Search web for home page

Program Committees

Publications

Coauthors of Yehuda Lindell