Jesper Buus Nielsen

International Association for Cryptologic Research

Jesper Buus Nielsen Search web for home page

Program Committees

1	2013	Eurocrypt	pc
2	2012	TCC	pc
3	2011	Crypto	pc
4	2011	PKC	pc
5	2011	Asiacrypt	pc
6	2010	Crypto	pc
7	2010	Asiacrypt	pc
8	2009	Crypto	pc
9	2009	PKC	pc
10	2008	PKC	pc
11	2007	Eurocrypt	pc
12	2007	Asiacrypt	pc
13	2006	TCC	pc
14	2004	Asiacrypt	pc

Publications

	year	title	booktitle	pages
1	2012	Signature Schemes Secure against Hard-to-Invert Leakage	asiacrypt	98-115
2	2012	A New Approach to Practical Active-Secure Two-Party Computation	crypto	681-700
3	2012	Actively Secure Two-Party Evaluation of Any Quantum Operation	crypto	794-811
4	2011	Lower and Upper Bounds for Deniable Public-Key Encryption	asiacrypt	125-142
5	2011	Perfectly Secure Oblivious RAM Without Random Oracles	tcc	144
6	2010	On the Necessary and Sufficient Assumptions for UC Computation	tcc	109-127
7	2010	From Passive to Covert Security at Low Cost	tcc	128-145
8	2010	Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries	crypto	685-706
9	2010	Perfectly Secure Oblivious RAM Without Random Oracles	eprint	online
10	2009	Asynchronous Multiparty Computation: Theory and Implementation	pkc	160-179
11	2009	Privacy-Enhancing Auctions Using Rational Cryptography	crypto	541-558
12	2009	LEGO for Two-Party Secure Computation	tcc	368-386
13	2009	Universally Composable Multiparty Computation with Partially Isolated Parties	tcc	315-331
14	2008	OT-Combiners via Secure Computation	tcc	393-411
15	2008	Scalable Multiparty Computation with Nearly Optimal Work and Resilience	crypto	241-261
16	2008	Multiparty Computation Goes Live	eprint	online
17	2008	Almost-Asynchronous MPC with Faulty Minority	eprint	online
18	2008	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eurocrypt	509-526
19	2008	LEGO for Two Party Secure Computation	eprint	online
20	2008	Essentially Optimal Universally Composable Oblivious Transfer	eprint	online
21	2007	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eprint	online
22	2007	Universally Composable Multiparty Computation with Partially Isolated Parties	eprint	online
23	2007	Scalable and Unconditionally Secure Multiparty Computation	crypto	572-590
24	2007	Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free	eprint	online
25	2007	Secure Protocols with Asymmetric Trust	asiacrypt	357-375
26	2006	Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation	tcc	online
27	2006	Robust Multiparty Computation with Linear Communication Complexity	crypto	online
28	2006	Simplified Threshold RSA with Adaptive and Proactive Security	eurocrypt	online
29	2005	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation	asiacrypt	online
30	2005	Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract)	eurocrypt	online
31	2005	How to Split a Shared Secret into Shared Bits in Constant-Round	eprint	online
32	2004	Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience	eprint	online
33	2004	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation	eprint	online
34	2003	Relaxing Chosen-Ciphertext Security	crypto	online
35	2003	Relaxing Chosen-Ciphertext Security	eprint	online
36	2003	Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption	crypto	online
37	2002	Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case	crypto	online
38	2002	A Threshold Pseudorandom Function Construction and Its Applications	crypto	online
39	2002	Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security	crypto	online
40	2002	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	crypto	online
41	2001	Multiparty Computation from Threshold Homomorphic Encryption	eurocrypt	280-299
42	2001	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	eprint	online
43	2000	Multiparty Computation from Threshold Homomorphic Encryption	eprint	online
44	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