| 2012 | ||
|---|---|---|
| 63 | 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) | |
| 62 | 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) | |
| 2011 | ||
| 61 | Carolin Lunemann, Jesper Buus Nielsen: Fully Simulatable Quantum-Secure Coin-Flipping and Applications. AFRICACRYPT 2011: 21-40 | |
| 60 | Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi: Lower and Upper Bounds for Deniable Public-Key Encryption. ASIACRYPT 2011: 125-142 | |
| 59 | Ivan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen: Perfectly Secure Oblivious RAM without Random Oracles. TCC 2011: 144-163 | |
| 58 | Carolin Lunemann, Jesper Buus Nielsen: Fully Simulatable Quantum-Secure Coin-Flipping and Applications CoRR abs/1102.0887: (2011) | |
| 57 | Ivan Damgård, Jakob Funder, Jesper Buus Nielsen, Louis Salvail: Superposition Attacks on Cryptographic Protocols CoRR abs/1108.6313: (2011) | |
| 56 | Ivan Damgård, Jakob Funder, Jesper Buus Nielsen, Louis Salvail: Superposition Attacks on Cryptographic Protocols}. IACR Cryptology ePrint Archive 2011: 421 (2011) | |
| 55 | 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) | |
| 54 | Carolin Lunemann, Jesper Buus Nielsen: Fully Simulatable Quantum-Secure Coin-Flipping and Applications. IACR Cryptology ePrint Archive 2011: 65 (2011) | |
| 53 | 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) | |
| 2010 | ||
| 52 | Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail: Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. CRYPTO 2010: 685-706 | |
| 51 | Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen: On the theoretical gap between synchronous and asynchronous MPC protocols. PODC 2010: 211-218 | |
| 50 | Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: On the Necessary and Sufficient Assumptions for UC Computation. TCC 2010: 109-127 | |
| 49 | Ivan Damgård, Martin Geisler, Jesper Buus Nielsen: From Passive to Covert Security at Low Cost. TCC 2010: 128-145 | |
| 48 | Ivan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen: Perfectly Secure Oblivious RAM Without Random Oracles. IACR Cryptology ePrint Archive 2010: 108 (2010) | |
| 47 | 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) | |
| 2009 | ||
| 46 | Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos: Privacy-Enhancing Auctions Using Rational Cryptography. CRYPTO 2009: 541-558 | |
| 45 | Matthias Fitzi, Jesper Buus Nielsen: On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. DISC 2009: 449-463 | |
| 44 | 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 | |
| 43 | Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen: Asynchronous Multiparty Computation: Theory and Implementation. Public Key Cryptography 2009: 160-179 | |
| 42 | Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Universally Composable Multiparty Computation with Partially Isolated Parties. TCC 2009: 315-331 | |
| 41 | Jesper Buus Nielsen, Claudio Orlandi: LEGO for Two-Party Secure Computation. TCC 2009: 368-386 | |
| 40 | Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: On the Necessary and Sufficient Assumptions for UC Computation. IACR Cryptology ePrint Archive 2009: 247 (2009) | |
| 39 | Ivan Damgård, Martin Geisler, Jesper Buus Nielsen: From Passive to Covert Security at Low Cost. IACR Cryptology ePrint Archive 2009: 592 (2009) | |
| 2008 | ||
| 38 | 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 | |
| 37 | Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Isolated Proofs of Knowledge and Isolated Zero Knowledge. EUROCRYPT 2008: 509-526 | |
| 36 | Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek: Asynchronous Multi-Party Computation with Quadratic Communication. ICALP (2) 2008: 473-485 | |
| 35 | Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: Essentially Optimal Universally Composable Oblivious Transfer. ICISC 2008: 318-335 | |
| 34 | Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen: OT-Combiners via Secure Computation. TCC 2008: 393-411 | |
| 33 | Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi: Essentially Optimal Universally Composable Oblivious Transfer. IACR Cryptology ePrint Archive 2008: 220 (2008) | |
| 32 | Matthias Fitzi, Jesper Buus Nielsen: On the Number of Synchronous Rounds Required for Byzantine Agreement. IACR Cryptology ePrint Archive 2008: 414 (2008) | |
| 31 | Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen: Asynchronous Multiparty Computation: Theory and Implementation. IACR Cryptology ePrint Archive 2008: 415 (2008) | |
| 30 | Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen: Almost-Asynchronous MPC with Faulty Minority. IACR Cryptology ePrint Archive 2008: 416 (2008) | |
| 29 | Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos: Privacy-Enhancing First-Price Auctions Using Rational Cryptography. IACR Cryptology ePrint Archive 2008: 418 (2008) | |
| 28 | Jesper Buus Nielsen, Claudio Orlandi: LEGO for Two Party Secure Computation. IACR Cryptology ePrint Archive 2008: 427 (2008) | |
| 27 | 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) | |
| 2007 | ||
| 26 | Ivan Damgård, Yvo Desmedt, Matthias Fitzi, Jesper Buus Nielsen: Secure Protocols with Asymmetric Trust. ASIACRYPT 2007: 357-375 | |
| 25 | Ivan Damgård, Jesper Buus Nielsen: Scalable and Unconditionally Secure Multiparty Computation. CRYPTO 2007: 572-590 | |
| 24 | Jesper Buus Nielsen: Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free. IACR Cryptology ePrint Archive 2007: 215 (2007) | |
| 23 | Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Isolated Proofs of Knowledge and Isolated Zero Knowledge. IACR Cryptology ePrint Archive 2007: 331 (2007) | |
| 22 | Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs: Universally Composable Multiparty Computation with Partially Isolated Parties. IACR Cryptology ePrint Archive 2007: 332 (2007) | |
| 2006 | ||
| 21 | Martin Hirt, Jesper Buus Nielsen: Robust Multiparty Computation with Linear Communication Complexity. CRYPTO 2006: 463-482 | |
| 20 | Jesús F. Almansa, Ivan Damgård, Jesper Buus Nielsen: Simplified Threshold RSA with Adaptive and Proactive Security. EUROCRYPT 2006: 593-611 | |
| 19 | 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 | ||
| 18 | Martin Hirt, Jesper Buus Nielsen: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. ASIACRYPT 2005: 79-99 | |
| 17 | Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek: Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract). EUROCRYPT 2005: 322-340 | |
| 16 | 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) | |
| 15 | 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 | ||
| 14 | Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass: Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195 | |
| 13 | Martin Hirt, Jesper Buus Nielsen: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. IACR Cryptology ePrint Archive 2004: 318 (2004) | |
| 12 | Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek: Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2004: 368 (2004) | |
| 2003 | ||
| 11 | Ivan Damgård, Jesper Buus Nielsen: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. CRYPTO 2003: 247-264 | |
| 10 | Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen: Relaxing Chosen-Ciphertext Security. CRYPTO 2003: 565-582 | |
| 9 | Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen: Relaxing Chosen-Ciphertext Security. IACR Cryptology ePrint Archive 2003: 174 (2003) | |
| 2002 | ||
| 8 | Jesper Buus Nielsen: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. CRYPTO 2002: 111-126 | |
| 7 | Jesper Buus Nielsen: A Threshold Pseudorandom Function Construction and Its Applications. CRYPTO 2002: 401-416 | |
| 6 | Ivan Damgård, Jesper Buus Nielsen: Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. CRYPTO 2002: 449-464 | |
| 5 | Ivan Damgård, Jesper Buus Nielsen: Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. CRYPTO 2002: 581-596 | |
| 2001 | ||
| 4 | Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen: Multiparty Computation from Threshold Homomorphic Encryption. EUROCRYPT 2001: 280-299 | |
| 3 | 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 | ||
| 2 | Ivan Damgård, Jesper Buus Nielsen: Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. CRYPTO 2000: 432-450 | |
| 1 | Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen: Multiparty Computation from Threshold Homomorphic Encryption. IACR Cryptology ePrint Archive 2000: 55 (2000) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page