Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jesper Buus Nielsen
2010 – today
- 2013
[c39]Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi: MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions. EUROCRYPT 2013: 537-556- [c38]Jesper Buus Nielsen, Daniele Venturi, Angela Zottarel: On the Connection between Leakage Tolerance and Adaptive Security. Public Key Cryptography 2013: 497-515
- [i31]Tore Kasper Frederiksen, Jesper Buus Nielsen: Fast and Maliciously Secure Two-Party Computation Using the GPU. IACR Cryptology ePrint Archive 2013: 46 (2013)
- [i30]Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi: MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions. IACR Cryptology ePrint Archive 2013: 155 (2013)
- 2012
- [c37]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel: Signature Schemes Secure against Hard-to-Invert Leakage. ASIACRYPT 2012: 98-115
- [c36]Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra: A New Approach to Practical Active-Secure Two-Party Computation. CRYPTO 2012: 681-700
- [c35]Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail: Actively Secure Two-Party Evaluation of Any Quantum Operation. CRYPTO 2012: 794-811
- [i29]Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra: A New Approach to Practical Active-Secure Two-Party Computation. CoRR abs/1202.3052 (2012)
- [i28]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel: Signature Schemes Secure against Hard-to-Invert Leakage. IACR Cryptology ePrint Archive 2012: 45 (2012)
- [i27]Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail: Actively Secure Two-Party Evaluation of any Quantum Operation. IACR Cryptology ePrint Archive 2012: 304 (2012)
- 2011
- [c34]Carolin Lunemann, Jesper Buus Nielsen: Fully Simulatable Quantum-Secure Coin-Flipping and Applications. AFRICACRYPT 2011: 21-40
- [c33]Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi: Lower and Upper Bounds for Deniable Public-Key Encryption. ASIACRYPT 2011: 125-142
- [c32]Ivan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen: Perfectly Secure Oblivious RAM without Random Oracles. TCC 2011: 144-163
- [i26]Carolin Lunemann, Jesper Buus Nielsen: Fully Simulatable Quantum-Secure Coin-Flipping and Applications. CoRR abs/1102.0887 (2011)
- [i25]Ivan Damgård, Jakob Funder, Jesper Buus Nielsen, Louis Salvail: Superposition Attacks on Cryptographic Protocols. CoRR abs/1108.6313 (2011)
- [i24]Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi: Lower and Upper Bounds for Deniable Public-Key Encryption. IACR Cryptology ePrint Archive 2011: 46 (2011)
- [i23]Carolin Lunemann, Jesper Buus Nielsen: Fully Simulatable Quantum-Secure Coin-Flipping and Applications. IACR Cryptology ePrint Archive 2011: 65 (2011)
- [i22]Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra: A New Approach to Practical Active-Secure Two-Party Computation. IACR Cryptology ePrint Archive 2011: 91 (2011)
- [i21]Ivan Damgård, Jakob Funder, Jesper Buus Nielsen, Louis Salvail: Superposition Attacks on Cryptographic Protocols}. IACR Cryptology ePrint Archive 2011: 421 (2011)
- 2010
- [j1]Ivan Damgård, Mads Jurik, Jesper Buus Nielsen: A generalization of Paillier's public-key system with applications to electronic voting. Int. J. Inf. Sec. 9(6): 371-385 (2010)
- [c31]Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail: Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. CRYPTO 2010: 685-706
- [c30]Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen: On the theoretical gap between synchronous and asynchronous MPC protocols. PODC 2010: 211-218
- [c29]Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: On the Necessary and Sufficient Assumptions for UC Computation. TCC 2010: 109-127
- [c28]Ivan Damgård, Martin Geisler, Jesper Buus Nielsen: From Passive to Covert Security at Low Cost. TCC 2010: 128-145
- [i20]Ivan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen: Perfectly Secure Oblivious RAM Without Random Oracles. IACR Cryptology ePrint Archive 2010: 108 (2010)
2000 – 2009
- 2009
- [c27]Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos: Privacy-Enhancing Auctions Using Rational Cryptography. CRYPTO 2009: 541-558
- [c26]Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas P. Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, Tomas Toft: Secure Multiparty Computation Goes Live. Financial Cryptography 2009: 325-343
- [c25]Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen: Asynchronous Multiparty Computation: Theory and Implementation. Public Key Cryptography 2009: 160-179
- [c24]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Universally Composable Multiparty Computation with Partially Isolated Parties. TCC 2009: 315-331
- [c23]
- [c22]Matthias Fitzi, Jesper Buus Nielsen: On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. DISC 2009: 449-463
- [i19]Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: On the Necessary and Sufficient Assumptions for UC Computation. IACR Cryptology ePrint Archive 2009: 247 (2009)
- [i18]Ivan Damgård, Martin Geisler, Jesper Buus Nielsen: From Passive to Covert Security at Low Cost. IACR Cryptology ePrint Archive 2009: 592 (2009)
- 2008
- [c21]Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith: Scalable Multiparty Computation with Nearly Optimal Work and Resilience. CRYPTO 2008: 241-261
- [c20]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Isolated Proofs of Knowledge and Isolated Zero Knowledge. EUROCRYPT 2008: 509-526
- [c19]Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek: Asynchronous Multi-Party Computation with Quadratic Communication. ICALP (2) 2008: 473-485
- [c18]Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: Essentially Optimal Universally Composable Oblivious Transfer. ICISC 2008: 318-335
- [c17]Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen: OT-Combiners via Secure Computation. TCC 2008: 393-411
- [i17]Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas P. Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, Tomas Toft: Multiparty Computation Goes Live. IACR Cryptology ePrint Archive 2008: 68 (2008)
- [i16]Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: Essentially Optimal Universally Composable Oblivious Transfer. IACR Cryptology ePrint Archive 2008: 220 (2008)
- [i15]Matthias Fitzi, Jesper Buus Nielsen: On the Number of Synchronous Rounds Required for Byzantine Agreement. IACR Cryptology ePrint Archive 2008: 414 (2008)
- [i14]Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen: Asynchronous Multiparty Computation: Theory and Implementation. IACR Cryptology ePrint Archive 2008: 415 (2008)
- [i13]Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen: Almost-Asynchronous MPC with Faulty Minority. IACR Cryptology ePrint Archive 2008: 416 (2008)
- [i12]Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos: Privacy-Enhancing First-Price Auctions Using Rational Cryptography. IACR Cryptology ePrint Archive 2008: 418 (2008)
- [i11]Jesper Buus Nielsen, Claudio Orlandi: LEGO for Two Party Secure Computation. IACR Cryptology ePrint Archive 2008: 427 (2008)
- 2007
- [c16]Ivan Damgård, Yvo Desmedt, Matthias Fitzi, Jesper Buus Nielsen: Secure Protocols with Asymmetric Trust. ASIACRYPT 2007: 357-375
- [c15]Ivan Damgård, Jesper Buus Nielsen: Scalable and Unconditionally Secure Multiparty Computation. CRYPTO 2007: 572-590
- [i10]Jesper Buus Nielsen: Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free. IACR Cryptology ePrint Archive 2007: 215 (2007)
- [i9]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Isolated Proofs of Knowledge and Isolated Zero Knowledge. IACR Cryptology ePrint Archive 2007: 331 (2007)
- [i8]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Universally Composable Multiparty Computation with Partially Isolated Parties. IACR Cryptology ePrint Archive 2007: 332 (2007)
- 2006
- [c14]Martin Hirt, Jesper Buus Nielsen: Robust Multiparty Computation with Linear Communication Complexity. CRYPTO 2006: 463-482
- [c13]Jesús F. Almansa, Ivan Damgård, Jesper Buus Nielsen: Simplified Threshold RSA with Adaptive and Proactive Security. EUROCRYPT 2006: 593-611
- [c12]Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. TCC 2006: 285-304
- 2005
- [c11]Martin Hirt, Jesper Buus Nielsen: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. ASIACRYPT 2005: 79-99
- [c10]Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek: Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract). EUROCRYPT 2005: 322-340
- [i7]Yunlei Zhao, Jesper Buus Nielsen, Robert H. Deng, Dengguo Feng: Generic yet Practical ZK Arguments from any Public-Coin HVZK. Electronic Colloquium on Computational Complexity (ECCC)(162) (2005)
- [i6]Ivan Damgård, Matthias Fitzi, Jesper Buus Nielsen, Tomas Toft: How to Split a Shared Secret into Shared Bits in Constant-Round. IACR Cryptology ePrint Archive 2005: 140 (2005)
- 2004
- [c9]Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass: Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195
- [i5]Martin Hirt, Jesper Buus Nielsen: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. IACR Cryptology ePrint Archive 2004: 318 (2004)
- [i4]Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek: Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2004: 368 (2004)
- 2003
- [c8]Ivan Damgård, Jesper Buus Nielsen: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. CRYPTO 2003: 247-264
- [c7]Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen: Relaxing Chosen-Ciphertext Security. CRYPTO 2003: 565-582
- [i3]Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen: Relaxing Chosen-Ciphertext Security. IACR Cryptology ePrint Archive 2003: 174 (2003)
- 2002
- [c6]Jesper Buus Nielsen: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. CRYPTO 2002: 111-126
- [c5]Jesper Buus Nielsen: A Threshold Pseudorandom Function Construction and Its Applications. CRYPTO 2002: 401-416
- [c4]Ivan Damgård, Jesper Buus Nielsen: Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. CRYPTO 2002: 449-464
- [c3]Ivan Damgård, Jesper Buus Nielsen: Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. CRYPTO 2002: 581-596
- 2001
- [c2]Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen: Multiparty Computation from Threshold Homomorphic Encryption. EUROCRYPT 2001: 280-299
- [i2]Ivan Damgård, Jesper Buus Nielsen: Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. IACR Cryptology ePrint Archive 2001: 91 (2001)
- 2000
- [c1]Ivan Damgård, Jesper Buus Nielsen: Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. CRYPTO 2000: 432-450
- [i1]Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen: Multiparty Computation from Threshold Homomorphic Encryption. IACR Cryptology ePrint Archive 2000: 55 (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:14 CEST by the dblp team