Jesper Buus Nielsen
Jesper Buus Nielsen
Professor of Computer Science, Aarhus University
Verified email at - Homepage
Cited by
Cited by
Secure Multiparty Computation and Secret Sharing
R Cramer, IB Damgård, JB Nielsen
Cambridge University Press, 2015
Multiparty computation from threshold homomorphic encryption
R Cramer, I Damgård, JB Nielsen
Advances in Cryptology—EUROCRYPT 2001: International Conference on the …, 2001
Secure multiparty computation goes live
P Bogetoft, DL Christensen, I Damgård, M Geisler, T Jakobsen, ...
International Conference on Financial Cryptography and Data Security, 325-343, 2009
Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation
I Damgård, M Fitzi, E Kiltz, JB Nielsen, T Toft
Theory of Cryptography Conference, 285-304, 2006
A new approach to practical active-secure two-party computation
JB Nielsen, PS Nordholt, C Orlandi, SS Burra
Annual Cryptology Conference, 681-700, 2012
Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
JB Nielsen
Annual International Cryptology Conference, 111-126, 2002
Relaxing chosen-ciphertext security
R Canetti, H Krawczyk, JB Nielsen
Advances in Cryptology-CRYPTO 2003: 23rd Annual International Cryptology …, 2003
Scalable and unconditionally secure multiparty computation
I Damgård, JB Nielsen
Annual International Cryptology Conference, 572-590, 2007
Asynchronous multiparty computation: Theory and implementation
I Damgård, M Geisler, M Krøigaard, JB Nielsen
International workshop on public key cryptography, 160-179, 2009
Universally composable efficient multiparty computation from threshold homomorphic encryption
I Damgård, JB Nielsen
Annual international cryptology conference, 247-264, 2003
Universally composable protocols with relaxed set-up assumptions
B Barak, R Canetti, JB Nielsen, R Pass
45th Annual IEEE Symposium on Foundations of Computer Science, 186-195, 2004
A generalization of Paillier’s public-key system with applications to electronic voting
I Damgård, M Jurik, JB Nielsen
International Journal of Information Security 9, 371-385, 2010
Perfectly secure oblivious RAM without random oracles
I Damgård, S Meldgaard, JB Nielsen
Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011 …, 2011
Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor
I Damgård, JB Nielsen
Annual International Cryptology Conference, 581-596, 2002
Improved non-committing encryption schemes based on a general complexity assumption
I Damgård, JB Nielsen
Advances in Cryptology—CRYPTO 2000: 20th Annual International Cryptology …, 2000
LEGO for two-party secure computation
JB Nielsen, C Orlandi
Theory of Cryptography Conference, 368-386, 2009
Scalable multiparty computation with nearly optimal work and resilience
I Damgård, Y Ishai, M Krøigaard, JB Nielsen, A Smith
Advances in Cryptology–CRYPTO 2008: 28th Annual International Cryptology …, 2008
Continuous non-malleable codes
S Faust, P Mukherjee, JB Nielsen, D Venturi
Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014 …, 2014
Yes, there is an oblivious RAM lower bound!
KG Larsen, JB Nielsen
Annual International Cryptology Conference, 523-542, 2018
OT-combiners via secure computation
D Harnik, Y Ishai, E Kushilevitz, JB Nielsen
Theory of Cryptography Conference, 393-411, 2008
The system can't perform the operation now. Try again later.
Articles 1–20