• What's new
• Archive
• Paper awards
• Videos
• Authors
• Coauthors
• By year
• By venue
• All Committees
• Most Committees
• Report errors
• About

Jesper Buus Nielsen  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2019	Continuous Non-Malleable Codes in the 8-Split-State Model	eurocrypt	531-561
2	2018	Yes, There is an Oblivious RAM Lower Bound!	crypto	523-542
3	2017	Predictable Arguments of Knowledge	pkc	121-150
4	2017	Non-malleable Codes with Split-State Refresh	pkc	279-309
5	2017	Fully Leakage-Resilient Codes	pkc	333-358
6	2017	On the Computational Overhead of MPC with Dishonest Majority	pkc	369-395
7	2017	The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited	crypto	167-187
8	2017	Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead	asiacrypt	629-659
9	2016	Unconditionally Secure Computation with Reduced Interaction	eurocrypt	online
10	2016	Rate-1, Linear Time and Additively Homomorphic UC Commitments	crypto	179-207
11	2016	On the Communication Required for Unconditionally Secure Multiplication	crypto	459-488
12	2016	On the Complexity of Additively Homomorphic UC Commitments	tcc	online
13	2016	Reactive Garbling: Foundation, Instantiation, Application	asiacrypt	online
14	2016	Cross and Clean: Amortized Garbled Circuits with Constant Overhead	tcc	582-603
15	2016	Signature Schemes Secure Against Hard-to-Invert Leakage	jofc	422-455
16	2015	Foundations of Reactive Garbling Schemes	eprint	online
17	2015	Predictable Arguments of Knowledge	eprint	online
18	2015	On the Complexity of Additively Homomorphic UC Commitments	eprint	online
19	2015	High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer	eprint	online
20	2015	TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation	eprint	online
21	2015	Unconditionally Secure Computation with Reduced Interaction	eprint	online
22	2015	Additively Homomorphic UC Commitments with Optimal Amortized Overhead	pkc	online
23	2015	A Tamper and Leakage Resilient von Neumann Architecture	pkc	online
24	2015	Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge	eurocrypt	online
25	2014	Leakage-Resilient Signatures with Graceful Degradation	pkc	online
26	2014	Continuous Non-malleable Codes	tcc	online
27	2014	On the Connection between Leakage Tolerance and Adaptive Security	eprint	online
28	2014	Adaptive versus Static Security in the UC Model	eprint	online
29	2014	An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation	eprint	online
30	2014	Invisible Adaptive Attacks	eprint	online
31	2014	Compact VSS and Efficient Homomorphic UC Commitments	eprint	online
32	2014	Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge	eprint	online
33	2014	On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation	eprint	online
34	2014	Continuous Non-malleable Codes	eprint	online
35	2014	A Tamper and Leakage Resilient Random Access Machine	eprint	online
36	2014	Faster Maliciously Secure Two-Party Computation Using the GPU	eprint	online
37	2014	Leakage-Resilient Signatures with Graceful Degradation	eprint	online
38	2014	Compact VSS and Efficient Homomorphic UC Commitments	asiacrypt	online
39	2013	On the Connection between Leakage Tolerance and Adaptive Security	pkc	online
40	2013	Limits on the Power of Cryptographic Cheap Talk	crypto	online
41	2013	MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions	eurocrypt	online
42	2012	A New Approach to Practical Active-Secure Two-Party Computation	crypto	online
43	2012	Actively Secure Two-Party Evaluation of Any Quantum Operation	crypto	online
44	2012	Signature Schemes Secure against Hard-to-Invert Leakage	asiacrypt	online
45	2011	Perfectly Secure Oblivious RAM Without Random Oracles	tcc	online
46	2011	Lower and Upper Bounds for Deniable Public-Key Encryption	asiacrypt	online
47	2010	On the Necessary and Sufficient Assumptions for UC Computation	tcc	online
48	2010	From Passive to Covert Security at Low Cost	tcc	online
49	2010	Perfectly Secure Oblivious RAM Without Random Oracles	eprint	online
50	2010	Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries	crypto	online
51	2009	LEGO for Two-Party Secure Computation	tcc	online
52	2009	Universally Composable Multiparty Computation with Partially Isolated Parties	tcc	online
53	2009	Asynchronous Multiparty Computation: Theory and Implementation	pkc	online
54	2009	Privacy-Enhancing Auctions Using Rational Cryptography	crypto	online
55	2008	OT-Combiners via Secure Computation	tcc	online
56	2008	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eurocrypt	online
57	2008	Multiparty Computation Goes Live	eprint	online
58	2008	Scalable Multiparty Computation with Nearly Optimal Work and Resilience	crypto	online
59	2008	Essentially Optimal Universally Composable Oblivious Transfer	eprint	online
60	2008	Almost-Asynchronous MPC with Faulty Minority	eprint	online
61	2008	LEGO for Two Party Secure Computation	eprint	online
62	2007	Secure Protocols with Asymmetric Trust	asiacrypt	online
63	2007	Scalable and Unconditionally Secure Multiparty Computation	crypto	online
64	2007	Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free	eprint	online
65	2007	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eprint	online
66	2007	Universally Composable Multiparty Computation with Partially Isolated Parties	eprint	online
67	2006	Robust Multiparty Computation with Linear Communication Complexity	crypto	online
68	2006	Simplified Threshold RSA with Adaptive and Proactive Security	eurocrypt	online
69	2006	Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation	tcc	online
70	2005	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation	asiacrypt	online
71	2005	Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract)	eurocrypt	online
72	2005	How to Split a Shared Secret into Shared Bits in Constant-Round	eprint	online
73	2004	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation	eprint	online
74	2004	Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience	eprint	online
75	2003	Relaxing Chosen-Ciphertext Security	crypto	online
76	2003	Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption	crypto	online
77	2003	Relaxing Chosen-Ciphertext Security	eprint	online
78	2002	Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security	crypto	online
79	2002	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	crypto	online
80	2002	Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case	crypto	online
81	2002	A Threshold Pseudorandom Function Construction and Its Applications	crypto	online
82	2001	Multiparty Computation from Threshold Homomorphic Encryption	eurocrypt	online
83	2001	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	eprint	online
84	2000	Improved Non-committing Encryption Schemes Based on a General Complexity Assumption	crypto	online
85	2000	Multiparty Computation from Threshold Homomorphic Encryption	eprint	online

Coauthors of Jesper Buus Nielsen

1. Divesh Aggarwal (1)
2. Jesús F. Almansa (1)
3. Zuzana Beerliová-Trubíniová (1)
4. Rikke Bendlin (1)
5. Peter Bogetoft (1)
6. Sai Sheshank Burra (2)
7. Ran Canetti (2)
8. Ignacio Cascudo (2)
9. Dan Lund Christensen (1)
10. Ronald Cramer (2)
11. Ivan Damgård (35)
12. Bernardo David (2)
13. Bernardo Machado David (2)
14. Yvo Desmedt (1)
15. Nico Döttling (2)
16. Frédéric Dupuis (3)
17. Antonio Faonio (4)
18. Sebastian Faust (6)
19. Matthias Fitzi (3)
20. Tore Kasper Frederiksen (7)
21. Martin Geisler (3)
22. Satrajit Ghosh (1)
23. Irene Giacomelli (3)
24. Danny Harnik (1)
25. Carmit Hazay (2)
26. Martin Hirt (6)
27. Pavel Hubácek (1)
28. Yuval Ishai (2)
29. Thomas Pelle Jakobsen (1)
30. Thomas P. Jakobsen (4)
31. Thomas Jakobsen (1)
32. Eike Kiltz (1)
33. Hugo Krawczyk (2)
34. Mikkel Krøigaard (3)
35. Eyal Kushilevitz (1)
36. Enrique Larraia (1)
37. Kasper Green Larsen (1)
38. Sigurd Meldgaard (2)
39. Peter Bro Miltersen (1)
40. Pratyay Mukherjee (4)
41. Janus Dam Nielsen (1)
42. Kurt Nielsen (1)
43. Michael Nielsen (1)
44. Tobias Nilges (1)
45. Peter Sebastian Nordholt (6)
46. Maciej Obremski (1)
47. Claudio Orlandi (11)
48. Emmanuela Orsini (1)
49. Rafail Ostrovsky (1)
50. Jakob Pagter (1)
51. Antigoni Polychroniadou (1)
52. Bartosz Przydatek (2)
53. Erick Purwanto (1)
54. Samuel Ranellucci (4)
55. Michael Raskin (1)
56. Adi Rosén (1)
57. Alon Rosen (1)
58. Louis Salvail (2)
59. Peter Scholl (1)
60. Michael Schwartzbach (1)
61. Nigel P. Smart (1)
62. Adam Smith (1)
63. Mario Strefler (1)
64. Tomas Toft (3)
65. Nikos Triandopoulos (1)
66. Roberto Trifiletti (4)
67. Daniele Venturi (10)
68. Daniel Wichs (4)
69. Angela Zottarel (6)