Jesper Buus Nielsen

International Association for Cryptologic Research

Jesper Buus Nielsen Search web for home page

Program Committees

1	2017	Eurocrypt	pc chair
2	2016	PKC	pc
3	2015	TCC	pc chair
4	2014	PKC	pc
5	2014	Asiacrypt	pc
6	2013	Eurocrypt	pc
7	2013	Crypto	pc
8	2012	TCC	pc
9	2011	Crypto	pc
10	2011	PKC	pc
11	2011	Asiacrypt	pc
12	2010	Crypto	pc
13	2010	Asiacrypt	pc
14	2009	Crypto	pc
15	2009	PKC	pc
16	2008	PKC	pc
17	2007	Eurocrypt	pc
18	2007	Asiacrypt	pc
19	2006	TCC	pc
20	2004	Asiacrypt	pc

Publications

	year	title	booktitle	pages
1	2017	Fully Leakage-Resilient Codes	pkc	333-358
2	2017	On the Computational Overhead of MPC with Dishonest Majority	pkc	369-395
3	2017	Predictable Arguments of Knowledge	pkc	121-150
4	2017	Non-malleable Codes with Split-State Refresh	pkc	279-309
5	2016	Reactive Garbling: Foundation, Instantiation, Application	asiacrypt	online
6	2016	Cross and Clean: Amortized Garbled Circuits with Constant Overhead	tcc	582-603
7	2016	On the Communication Required for Unconditionally Secure Multiplication	crypto	459-488
8	2016	On the Complexity of Additively Homomorphic UC Commitments	tcc	542-565
9	2016	Unconditionally Secure Computation with Reduced Interaction	eurocrypt	420-447
10	2016	Rate-1, Linear Time and Additively Homomorphic UC Commitments	crypto	179-207
11	2015	TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation	eprint	309
12	2015	Additively Homomorphic UC Commitments with Optimal Amortized Overhead	pkc	495-515
13	2015	A Tamper and Leakage Resilient von Neumann Architecture	pkc	579-603
14	2015	On the Complexity of Additively Homomorphic UC Commitments	eprint	694
15	2015	Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge	eurocrypt	191-219
16	2015	Predictable Arguments of Knowledge	eprint	740
17	2015	Unconditionally Secure Computation with Reduced Interaction	eprint	630
18	2015	High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer	eprint	472
19	2015	Foundations of Reactive Garbling Schemes	eprint	693
20	2014	Adaptive versus Static Security in the UC Model	eprint	601
21	2014	A Tamper and Leakage Resilient Random Access Machine	eprint	338
22	2014	An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation	eprint	24
23	2014	Faster Maliciously Secure Two-Party Computation Using the GPU	eprint	270
24	2014	Compact VSS and Efficient Homomorphic UC Commitments	eprint	370
25	2014	Leakage-Resilient Signatures with Graceful Degradation	eprint	529
26	2014	Compact VSS and Efficient Homomorphic UC Commitments	asiacrypt	213-232
27	2014	Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge	eprint	598
28	2014	Leakage-Resilient Signatures with Graceful Degradation	pkc	362-379
29	2014	On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation	eprint	282
30	2014	Continuous Non-malleable Codes	eprint	173
31	2014	Continuous Non-malleable Codes	tcc	465-488
32	2014	Invisible Adaptive Attacks	eprint	597
33	2014	On the Connection between Leakage Tolerance and Adaptive Security	eprint	517
34	2013	Limits on the Power of Cryptographic Cheap Talk	crypto	277-297
35	2013	MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions	eurocrypt	537-556
36	2013	On the Connection between Leakage Tolerance and Adaptive Security	PKC	493
37	2012	Signature Schemes Secure against Hard-to-Invert Leakage	asiacrypt	98-115
38	2012	A New Approach to Practical Active-Secure Two-Party Computation	crypto	681-700
39	2012	Actively Secure Two-Party Evaluation of Any Quantum Operation	crypto	794-811
40	2011	Lower and Upper Bounds for Deniable Public-Key Encryption	asiacrypt	125-142
41	2011	Perfectly Secure Oblivious RAM Without Random Oracles	tcc	144
42	2010	On the Necessary and Sufficient Assumptions for UC Computation	tcc	109-127
43	2010	From Passive to Covert Security at Low Cost	tcc	128-145
44	2010	Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries	crypto	685-706
45	2010	Perfectly Secure Oblivious RAM Without Random Oracles	eprint	online
46	2009	Asynchronous Multiparty Computation: Theory and Implementation	pkc	160-179
47	2009	Privacy-Enhancing Auctions Using Rational Cryptography	crypto	541-558
48	2009	LEGO for Two-Party Secure Computation	tcc	368-386
49	2009	Universally Composable Multiparty Computation with Partially Isolated Parties	tcc	315-331
50	2008	OT-Combiners via Secure Computation	tcc	393-411
51	2008	Scalable Multiparty Computation with Nearly Optimal Work and Resilience	crypto	241-261
52	2008	Multiparty Computation Goes Live	eprint	online
53	2008	Almost-Asynchronous MPC with Faulty Minority	eprint	online
54	2008	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eurocrypt	509-526
55	2008	LEGO for Two Party Secure Computation	eprint	online
56	2008	Essentially Optimal Universally Composable Oblivious Transfer	eprint	online
57	2007	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eprint	online
58	2007	Universally Composable Multiparty Computation with Partially Isolated Parties	eprint	online
59	2007	Scalable and Unconditionally Secure Multiparty Computation	crypto	572-590
60	2007	Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free	eprint	online
61	2007	Secure Protocols with Asymmetric Trust	asiacrypt	357-375
62	2006	Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation	tcc	online
63	2006	Robust Multiparty Computation with Linear Communication Complexity	crypto	online
64	2006	Simplified Threshold RSA with Adaptive and Proactive Security	eurocrypt	online
65	2005	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation	asiacrypt	online
66	2005	Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract)	eurocrypt	online
67	2005	How to Split a Shared Secret into Shared Bits in Constant-Round	eprint	online
68	2004	Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience	eprint	online
69	2004	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation	eprint	online
70	2003	Relaxing Chosen-Ciphertext Security	crypto	online
71	2003	Relaxing Chosen-Ciphertext Security	eprint	online
72	2003	Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption	crypto	online
73	2002	Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case	crypto	online
74	2002	A Threshold Pseudorandom Function Construction and Its Applications	crypto	online
75	2002	Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security	crypto	online
76	2002	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	crypto	online
77	2001	Multiparty Computation from Threshold Homomorphic Encryption	eurocrypt	280-299
78	2001	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	eprint	online
79	2000	Multiparty Computation from Threshold Homomorphic Encryption	eprint	online
80	2000	Improved Non-committing Encryption Schemes Based on a General Complexity Assumption	crypto	432-450

Jesper Buus Nielsen Search web for home page

Program Committees

Publications

Coauthors of Jesper Buus Nielsen