default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesper Buus Nielsen
Person information
- affiliation: Aarhus University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c96]Julian Loss, Jesper Buus Nielsen:
Early Stopping for Any Number of Corruptions. EUROCRYPT (3) 2024: 457-488- [i93]Adam Blatchley Hansen, Jesper Buus Nielsen, Mark Simkin:
OCash: Fully Anonymous Payments between Blockchain Light Clients. IACR Cryptol. ePrint Arch. 2024: 246 (2024) - 2023
- [c95]Orestis Alpos, Christian Cachin, Simon Holmgaard Kamp, Jesper Buus Nielsen:
Practical Large-Scale Proof-Of-Stake Asynchronous Total-Order Broadcast. AFT 2023: 31:1-31:22 - [c94]Mathias Hall-Andersen
, Jesper Buus Nielsen:
On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random Oracles. EUROCRYPT (2) 2023: 438-469 - [c93]Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner:
CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. Public Key Cryptography (1) 2023: 439-470 - [i92]Orestis Alpos, Christian Cachin, Simon Holmgaard Kamp, Jesper Buus Nielsen:
Practical Large-Scale Proof-of-Stake Asynchronous Total-Order Broadcast. IACR Cryptol. ePrint Arch. 2023: 1103 (2023) - [i91]Simon Holmgaard Kamp, Jesper Buus Nielsen:
Byzantine Agreement Decomposed: Honest Majority Asynchronous Total-Order Broadcast from Reliable Broadcast. IACR Cryptol. ePrint Arch. 2023: 1738 (2023) - [i90]Julian Loss, Jesper Buus Nielsen:
Early Stopping for Any Number of Corruptions. IACR Cryptol. ePrint Arch. 2023: 1813 (2023) - 2022
- [j11]Ivan Damgård, Thomas P. Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergaard:
Fast threshold ECDSA with honest majority. J. Comput. Secur. 30(1): 167-196 (2022) - [c92]Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders Konring, Jesper Buus Nielsen:
Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. ASIACRYPT (3) 2022: 151-180 - [c91]Bernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi:
GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy. CCS 2022: 683-696 - [c90]Jesper Buus Nielsen, João Ribeiro, Maciej Obremski:
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. CRYPTO (1) 2022: 127-147 - [c89]Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen:
Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks. CRYPTO (2) 2022: 400-430 - [c88]Suvradip Chakraborty, Bernardo Magri, Jesper Buus Nielsen, Daniele Venturi:
Universally Composable Subversion-Resilient Cryptography. EUROCRYPT (1) 2022: 272-302 - [i89]Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen:
Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks. IACR Cryptol. ePrint Arch. 2022: 10 (2022) - [i88]Simon Holmgaard Kamp, Jesper Buus Nielsen, Søren Eller Thomsen, Daniel Tschudi:
Enig: Player Replaceable Finality Layers with Optimal Validity. IACR Cryptol. ePrint Arch. 2022: 201 (2022) - [i87]Jesper Buus Nielsen, João Ribeiro, Maciej Obremski:
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. IACR Cryptol. ePrint Arch. 2022: 237 (2022) - [i86]Suvradip Chakraborty, Bernardo Magri, Jesper Buus Nielsen, Daniele Venturi:
Universally Composable Subversion-Resilient Cryptography. IACR Cryptol. ePrint Arch. 2022: 244 (2022) - [i85]Mathias Hall-Andersen, Jesper Buus Nielsen:
On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles. IACR Cryptol. ePrint Arch. 2022: 542 (2022) - 2021
- [j10]Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart:
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. J. Cryptol. 34(3): 34 (2021) - [c87]Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, Sophia Yakoubov:
YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles. CRYPTO (2) 2021: 64-93 - [c86]Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner:
TARDIS: A Foundation of Time-Lock Puzzles in UC. EUROCRYPT (3) 2021: 429-459 - [c85]Simon Holmgaard Kamp, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen, Daniel Tschudi:
Weight-Based Nakamoto-Style Blockchains. LATINCRYPT 2021: 299-319 - [c84]Craig Gentry, Shai Halevi, Bernardo Magri, Jesper Buus Nielsen, Sophia Yakoubov:
Random-Index PIR and Applications. TCC (3) 2021: 32-61 - [i84]Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, Sophia Yakoubov:
YOSO: You Only Speak Once / Secure MPC with Stateless Ephemeral Roles. IACR Cryptol. ePrint Arch. 2021: 210 (2021) - [i83]Bernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi:
GearBox: An Efficient UC Sharded Ledger Leveraging the Safety-Liveness Dichotomy. IACR Cryptol. ePrint Arch. 2021: 211 (2021) - [i82]Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders K. Kristensen, Jesper Buus Nielsen:
Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. IACR Cryptol. ePrint Arch. 2021: 1423 (2021) - 2020
- [j9]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
Continuously Non-malleable Codes in the Split-State Model. J. Cryptol. 33(4): 2034-2077 (2020) - [c83]Suvradip Chakraborty, Stefan Dziembowski, Jesper Buus Nielsen:
Reverse Firewalls for Actively Secure MPCs. CRYPTO (2) 2020: 732-762 - [c82]Jesper Buus Nielsen, Mark Simkin:
Lower Bounds for Leakage-Resilient Secret Sharing. EUROCRYPT (1) 2020: 556-577 - [c81]Thomas Dinsdale-Young, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi:
Afgjort: A Partially Synchronous Finality Layer for Blockchains. SCN 2020: 24-44 - [c80]Ivan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergård:
Fast Threshold ECDSA with Honest Majority. SCN 2020: 382-400 - [i81]Simon Holmgaard Kamp, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Søren Eller Thomsen, Daniel Tschudi:
Leveraging Weight Functions for Optimistic Responsiveness in Blockchains. IACR Cryptol. ePrint Arch. 2020: 328 (2020) - [i80]Ivan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergård:
Fast Threshold ECDSA with Honest Majority. IACR Cryptol. ePrint Arch. 2020: 501 (2020) - [i79]Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner:
TARDIS: Time And Relative Delays In Simulation. IACR Cryptol. ePrint Arch. 2020: 537 (2020) - [i78]Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner:
CRAFT: Composable Randomness and Almost Fairness from Time. IACR Cryptol. ePrint Arch. 2020: 784 (2020) - [i77]Craig Gentry, Shai Halevi, Bernardo Magri, Jesper Buus Nielsen, Sophia Yakoubov:
Random-index PIR with Applications to Large-Scale Secure MPC. IACR Cryptol. ePrint Arch. 2020: 1248 (2020)
2010 – 2019
- 2019
- [j8]Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi:
Continuously non-malleable codes with split-state refresh. Theor. Comput. Sci. 759: 98-132 (2019) - [c79]Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen:
Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. CRYPTO (2) 2019: 61-84 - [c78]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) 2019: 510-539 - [c77]Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto:
Continuous Non-Malleable Codes in the 8-Split-State Model. EUROCRYPT (1) 2019: 531-561 - [c76]Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen:
Lower Bounds for Oblivious Data Structures. SODA 2019: 2439-2447 - [i76]Jesper Buus Nielsen, Mark Simkin:
Lower Bounds for Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2019: 181 (2019) - [i75]Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen:
Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing. IACR Cryptol. ePrint Arch. 2019: 220 (2019) - [i74]Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi:
Afgjort - A Semi-Synchronous Finality Layer for Blockchains. IACR Cryptol. ePrint Arch. 2019: 504 (2019) - [i73]Suvradip Chakraborty, Stefan Dziembowski, Jesper Buus Nielsen:
Reverse Firewalls for Actively Secure MPCs. IACR Cryptol. ePrint Arch. 2019: 1317 (2019) - 2018
- [c75]Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi:
Continuously Non-malleable Codes with Split-State Refresh. ACNS 2018: 121-139 - [c74]Kasper Green Larsen, Jesper Buus Nielsen:
Yes, There is an Oblivious RAM Lower Bound! CRYPTO (2) 2018: 523-542 - [e8]Jesper Buus Nielsen, Vincent Rijmen:
Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I. Lecture Notes in Computer Science 10820, Springer 2018, ISBN 978-3-319-78380-2 [contents] - [e7]Jesper Buus Nielsen, Vincent Rijmen:
Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II. Lecture Notes in Computer Science 10821, Springer 2018, ISBN 978-3-319-78374-1 [contents] - [e6]Jesper Buus Nielsen, Vincent Rijmen:
Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III. Lecture Notes in Computer Science 10822, Springer 2018, ISBN 978-3-319-78371-0 [contents] - [i72]Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen:
Lower Bounds for Oblivious Data Structures. CoRR abs/1810.10635 (2018) - [i71]Kasper Green Larsen, Jesper Buus Nielsen:
Yes, There is an Oblivious RAM Lower Bound! Electron. Colloquium Comput. Complex. TR18 (2018) - [i70]Kasper Green Larsen, Jesper Buus Nielsen:
Yes, There is an Oblivious RAM Lower Bound! IACR Cryptol. ePrint Arch. 2018: 423 (2018) - [i69]Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi:
Continuously Non-Malleable Codes with Split-State Refresh. IACR Cryptol. ePrint Arch. 2018: 606 (2018) - [i68]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. IACR Cryptol. ePrint Arch. 2018: 1147 (2018) - 2017
- [j7]Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi:
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model. Theor. Comput. Sci. 660: 23-56 (2017) - [c73]Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges:
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. ASIACRYPT (1) 2017: 629-659 - [c72]Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti:
DUPLO: Unifying Cut-and-Choose for Garbled Circuits. CCS 2017: 3-20 - [c71]Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti:
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. CCS 2017: 2263-2276 - [c70]Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci:
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. CRYPTO (1) 2017: 167-187 - [c69]Jesper Buus Nielsen, Thomas Schneider, Roberto Trifiletti:
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. NDSS 2017 - [c68]Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi:
Predictable Arguments of Knowledge. Public Key Cryptography (1) 2017: 121-150 - [c67]Antonio Faonio, Jesper Buus Nielsen:
Non-malleable Codes with Split-State Refresh. Public Key Cryptography (1) 2017: 279-309 - [c66]Antonio Faonio, Jesper Buus Nielsen:
Fully Leakage-Resilient Codes. Public Key Cryptography (1) 2017: 333-358 - [c65]Jesper Buus Nielsen, Samuel Ranellucci:
On the Computational Overhead of MPC with Dishonest Majority. Public Key Cryptography (2) 2017: 369-395 - [e5]Jean-Sébastien Coron, Jesper Buus Nielsen:
Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10210, 2017, ISBN 978-3-319-56619-1 [contents] - [e4]Jean-Sébastien Coron, Jesper Buus Nielsen:
Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10211, 2017, ISBN 978-3-319-56613-9 [contents] - [e3]Jean-Sébastien Coron, Jesper Buus Nielsen:
Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III. Lecture Notes in Computer Science 10212, 2017, ISBN 978-3-319-56616-0 [contents] - [i67]Nico Döttling, Jesper Buus Nielsen, Maciej Obremski:
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model. Electron. Colloquium Comput. Complex. TR17 (2017) - [i66]Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti:
DUPLO: Unifying Cut-and-Choose for Garbled Circuits. IACR Cryptol. ePrint Arch. 2017: 344 (2017) - [i65]Nico Döttling, Jesper Buus Nielsen, Maciej Obremski:
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model. IACR Cryptol. ePrint Arch. 2017: 357 (2017) - [i64]Jesper Buus Nielsen:
Universally Composable Zero-Knowledge Proof of Membership. IACR Cryptol. ePrint Arch. 2017: 362 (2017) - [i63]Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges:
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. IACR Cryptol. ePrint Arch. 2017: 409 (2017) - [i62]Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti:
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. IACR Cryptol. ePrint Arch. 2017: 790 (2017) - 2016
- [j6]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel:
Signature Schemes Secure Against Hard-to-Invert Leakage. J. Cryptol. 29(2): 422-455 (2016) - [c64]Jesper Buus Nielsen, Samuel Ranellucci:
Reactive Garbling: Foundation, Instantiation, Application. ASIACRYPT (2) 2016: 1022-1052 - [c63]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. CRYPTO (3) 2016: 179-207 - [c62]Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin:
On the Communication Required for Unconditionally Secure Multiplication. CRYPTO (2) 2016: 459-488 - [c61]Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén:
Unconditionally Secure Computation with Reduced Interaction. EUROCRYPT (2) 2016: 420-447 - [c60]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti:
On the Complexity of Additively Homomorphic UC Commitments. TCC (A1) 2016: 542-565 - [c59]Jesper Buus Nielsen, Claudio Orlandi:
Cross and Clean: Amortized Garbled Circuits with Constant Overhead. TCC (B1) 2016: 582-603 - [i61]Thomas P. Jakobsen, Jesper Buus Nielsen, Claudio Orlandi:
A Framework for Outsourcing of Secure Computation. IACR Cryptol. ePrint Arch. 2016: 37 (2016) - [i60]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2016: 137 (2016) - [i59]Jesper Buus Nielsen, Claudio Orlandi:
Cross&Clean: Amortized Garbled Circuits with Constant Overhead. IACR Cryptol. ePrint Arch. 2016: 495 (2016) - [i58]Jesper Buus Nielsen, Samuel Ranellucci:
On the Computational Overhead of MPC with Dishonest Majority. IACR Cryptol. ePrint Arch. 2016: 643 (2016) - [i57]Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci:
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation. IACR Cryptol. ePrint Arch. 2016: 695 (2016) - [i56]Jesper Buus Nielsen, Thomas Schneider, Roberto Trifiletti:
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. IACR Cryptol. ePrint Arch. 2016: 1069 (2016) - [i55]Antonio Faonio, Jesper Buus Nielsen:
Non-Malleable Codes with Split-State Refresh. IACR Cryptol. ePrint Arch. 2016: 1192 (2016) - 2015
- [b1]Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen:
Secure Multiparty Computation and Secret Sharing. Cambridge University Press 2015, ISBN 9781107043053 - [c58]Tore Kasper Frederiksen, Jesper Buus Nielsen, Claudio Orlandi:
Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. EUROCRYPT (2) 2015: 191-219 - [c57]Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi:
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation. ICALP (1) 2015: 456-468 - [c56]Ivan Damgård, Frédéric Dupuis, Jesper Buus Nielsen:
On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation. ICITS 2015: 87-104 - [c55]Ignacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC Commitments with Optimal Amortized Overhead. Public Key Cryptography 2015: 495-515 - [c54]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
A Tamper and Leakage Resilient von Neumann Architecture. Public Key Cryptography 2015: 579-603 - [e2]Yevgeniy Dodis, Jesper Buus Nielsen:
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. Lecture Notes in Computer Science 9014, Springer 2015, ISBN 978-3-662-46493-9 [contents] - [e1]Yevgeniy Dodis, Jesper Buus Nielsen:
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9015, Springer 2015, ISBN 978-3-662-46496-0 [contents] - [i54]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti:
TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation. IACR Cryptol. ePrint Arch. 2015: 309 (2015) - [i53]Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart:
High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. IACR Cryptol. ePrint Arch. 2015: 472 (2015) - [i52]Ivan Damgård, Jesper Buus Nielsen:
Unconditionally Secure Computation with Reduced Interaction. IACR Cryptol. ePrint Arch. 2015: 630 (2015) - [i51]Jesper Buus Nielsen, Samuel Ranellucci:
Foundations of Reactive Garbling Schemes. IACR Cryptol. ePrint Arch. 2015: 693 (2015) - [i50]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti:
On the Complexity of Additively Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2015: 694 (2015) - [i49]Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi:
Predictable Arguments of Knowledge. IACR Cryptol. ePrint Arch. 2015: 740 (2015) - [i48]Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou:
On the Communication required for Unconditionally Secure Multiplication. IACR Cryptol. ePrint Arch. 2015: 1097 (2015) - [i47]Antonio Faonio, Jesper Buus Nielsen:
Fully Leakage-Resilient Codes. IACR Cryptol. ePrint Arch. 2015: 1151 (2015) - 2014
- [c53]Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen:
Compact VSS and Efficient Homomorphic UC Commitments. ASIACRYPT (2) 2014: 213-232 - [c52]Thomas P. Jakobsen, Jesper Buus Nielsen, Claudio Orlandi:
A Framework for Outsourcing of Secure Computation. CCSW 2014: 81-92 - [c51]Jesper Buus Nielsen, Daniele Venturi, Angela Zottarel:
Leakage-Resilient Signatures with Graceful Degradation. Public Key Cryptography 2014: 362-379 - [c50]Ivan Damgård, Jesper Buus Nielsen:
Adaptive versus Static Security in the UC Model. ProvSec 2014: 10-28 - [c49]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen:
Faster Maliciously Secure Two-Party Computation Using the GPU. SCN 2014: 358-379 - [c48]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
Continuous Non-malleable Codes. TCC 2014: 465-488 - [i46]Ivan Damgård, Jesper Buus Nielsen:
An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 24 (2014) - [i45]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
Continuous Non-malleable Codes. IACR Cryptol. ePrint Arch. 2014: 173 (2014) - [i44]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen:
Faster Maliciously Secure Two-Party Computation Using the GPU. IACR Cryptol. ePrint Arch. 2014: 270 (2014) - [i43]Ivan Damgård, Frédéric Dupuis, Jesper Buus Nielsen:
On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation. IACR Cryptol. ePrint Arch. 2014: 282 (2014) - [i42]Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
A Tamper and Leakage Resilient Random Access Machine. IACR Cryptol. ePrint Arch. 2014: 338 (2014) - [i41]Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen:
Compact VSS and Efficient Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2014: 370 (2014) - [i40]Jesper Buus Nielsen, Daniele Venturi, Angela Zottarel:
On the Connection between Leakage Tolerance and Adaptive Security. IACR Cryptol. ePrint Arch. 2014: 517 (2014) - [i39]Jesper Buus Nielsen, Daniele Venturi, Angela Zottarel:
Leakage-Resilient Signatures with Graceful Degradation. IACR Cryptol. ePrint Arch. 2014: 529 (2014) - [i38]Jesper Buus Nielsen, Mario Strefler:
Invisible Adaptive Attacks. IACR Cryptol. ePrint Arch. 2014: 597 (2014) - [i37]Tore Kasper Frederiksen, Jesper Buus Nielsen, Claudio Orlandi:
Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge. IACR Cryptol. ePrint Arch. 2014: 598 (2014) - [i36]Ivan Damgård, Jesper Buus Nielsen:
Adaptive versus Static Security in the UC Model. IACR Cryptol. ePrint Arch. 2014: 601 (2014) - [i35]Ignacio Cascudo, Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC commitments with Optimal Amortized Overhead. IACR Cryptol. ePrint Arch. 2014: 829 (2014) - [i34]Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi:
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation. IACR Cryptol. ePrint Arch. 2014: 913 (2014) - 2013
- [c47]Tore Kasper Frederiksen, Jesper Buus Nielsen:
Fast and Maliciously Secure Two-Party Computation Using the GPU. ACNS 2013: 339-356 - [c46]Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen:
Limits on the Power of Cryptographic Cheap Talk. CRYPTO (1) 2013: 277-297 - [c45]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 - [c44]Ivan Damgård, Jakob Funder, Jesper Buus Nielsen, Louis Salvail:
Superposition Attacks on Cryptographic Protocols. ICITS 2013: 142-161 - [c43]Ivan Damgård, Thomas P. Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter:
Secure Key Management in the Cloud. IMACC 2013: 270-289 - [c42]Jesper Buus Nielsen, Daniele Venturi, Angela Zottarel:
On the Connection between Leakage Tolerance and Adaptive Security. Public Key Cryptography 2013: 497-515 - [i33]Tore Kasper Frederiksen, Jesper Buus Nielsen:
Fast and Maliciously Secure Two-Party Computation Using the GPU. IACR Cryptol. ePrint Arch. 2013: 46 (2013) - [i32]Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi:
MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions. IACR Cryptol. ePrint Arch. 2013: 155 (2013) - [i31]Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen:
Limits on the Power of Cryptographic Cheap Talk. IACR Cryptol. ePrint Arch. 2013: 499 (2013) - [i30]Ivan Damgård, Thomas P. Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter:
Secure Key Management in the Cloud. IACR Cryptol. ePrint Arch. 2013: 629 (2013) - 2012
- [c41]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel:
Signature Schemes Secure against Hard-to-Invert Leakage. ASIACRYPT 2012: 98-115 - [c40]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 - [c39]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 Cryptol. ePrint Arch. 2012: 45 (2012) - [i27]Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail:
Actively Secure Two-Party Evaluation of any Quantum Operation. IACR Cryptol. ePrint Arch. 2012: 304 (2012) - 2011
- [j5]Jesper Buus Nielsen, Anders K. Kristensen, Thomas Mailund, Christian N. S. Pedersen:
A sub-cubic time algorithm for computing the quartet distance between two general trees. Algorithms Mol. Biol. 6: 15 (2011) - [j4]Thomas Greve Kristensen, Jesper Buus Nielsen, Christian N. S. Pedersen:
Using Inverted Indices for Accelerating LINGO Calculations. J. Chem. Inf. Model. 51(3): 597-600 (2011) - [c38]Carolin Lunemann, Jesper Buus Nielsen:
Fully Simulatable Quantum-Secure Coin-Flipping and Applications. AFRICACRYPT 2011: 21-40 - [c37]Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi:
Lower and Upper Bounds for Deniable Public-Key Encryption. ASIACRYPT 2011: 125-142 - [c36]Jesper Buus Nielsen, Andreas Sand:
Algorithms for a Parallel Implementation of Hidden Markov Models with a Small State Space. IPDPS Workshops 2011: 452-459 - [c35]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 Cryptol. ePrint Arch. 2011: 46 (2011) - [i23]Carolin Lunemann, Jesper Buus Nielsen:
Fully Simulatable Quantum-Secure Coin-Flipping and Applications. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2011: 91 (2011) - [i21]Ivan Damgård, Jakob Funder, Jesper Buus Nielsen, Louis Salvail:
Superposition Attacks on Cryptographic Protocols}. IACR Cryptol. ePrint Arch. 2011: 421 (2011) - 2010
- [j3]Thomas Greve Kristensen, Jesper Buus Nielsen, Christian N. S. Pedersen:
A tree-based method for the rapid screening of chemical fingerprints. Algorithms Mol. Biol. 5: 9 (2010) - [j2]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) - [c34]Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos:
Privacy-enhancing auctions using rational cryptography. BQGT 2010: 90:1 - [c33]Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail:
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. CRYPTO 2010: 685-706 - [c32]Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen:
On the theoretical gap between synchronous and asynchronous MPC protocols. PODC 2010: 211-218 - [c31]Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi:
On the Necessary and Sufficient Assumptions for UC Computation. TCC 2010: 109-127 - [c30]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 Cryptol. ePrint Arch. 2010: 108 (2010)
2000 – 2009
- 2009
- [c29]Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos:
Privacy-Enhancing Auctions Using Rational Cryptography. CRYPTO 2009: 541-558 - [c28]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 - [c27]Thomas Mailund, Jesper Buus Nielsen, Christian N. S. Pedersen:
A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees. IJCBS 2009: 565-568 - [c26]Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen:
Asynchronous Multiparty Computation: Theory and Implementation. Public Key Cryptography 2009: 160-179 - [c25]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Universally Composable Multiparty Computation with Partially Isolated Parties. TCC 2009: 315-331 - [c24]Jesper Buus Nielsen, Claudio Orlandi:
LEGO for Two-Party Secure Computation. TCC 2009: 368-386 - [c23]Thomas Greve Kristensen, Jesper Buus Nielsen, Christian N. S. Pedersen:
A Tree Based Method for the Rapid Screening of Chemical Fingerprints. WABI 2009: 194-205 - [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 Cryptol. ePrint Arch. 2009: 247 (2009) - [i18]Ivan Damgård, Martin Geisler, Jesper Buus Nielsen:
From Passive to Covert Security at Low Cost. IACR Cryptol. ePrint Arch. 2009: 592 (2009) - 2008
- [j1]Jesper Buus Nielsen, Thomas Mailund:
SNPFile - A software library and file format for large scale association mapping and population genetics studies. BMC Bioinform. 9 (2008) - [c21]Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam D. 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 Cryptol. ePrint Arch. 2008: 68 (2008) - [i16]Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi:
Essentially Optimal Universally Composable Oblivious Transfer. IACR Cryptol. ePrint Arch. 2008: 220 (2008) - [i15]Matthias Fitzi, Jesper Buus Nielsen:
On the Number of Synchronous Rounds Required for Byzantine Agreement. IACR Cryptol. ePrint Arch. 2008: 414 (2008) - [i14]Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen:
Asynchronous Multiparty Computation: Theory and Implementation. IACR Cryptol. ePrint Arch. 2008: 415 (2008) - [i13]Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen:
Almost-Asynchronous MPC with Faulty Minority. IACR Cryptol. ePrint Arch. 2008: 416 (2008) - [i12]Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos:
Privacy-Enhancing First-Price Auctions Using Rational Cryptography. IACR Cryptol. ePrint Arch. 2008: 418 (2008) - [i11]Jesper Buus Nielsen, Claudio Orlandi:
LEGO for Two Party Secure Computation. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2007: 215 (2007) - [i9]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Isolated Proofs of Knowledge and Isolated Zero Knowledge. IACR Cryptol. ePrint Arch. 2007: 331 (2007) - [i8]Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Universally Composable Multiparty Computation with Partially Isolated Parties. IACR Cryptol. ePrint Arch. 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. Electron. Colloquium Comput. Complex. TR05 (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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2004: 318 (2004) - [i4]Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek:
Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2000: 55 (2000)
Coauthor Index
[j11] [c80] [i80] [c79] [c78] [i75] [i68] [c70] [c63] [c62] [c61] [i60] [i57] [b1] [c56] [c55] [i52] [i48] [c53] [c50] [i46] [i43] [i41] [i36] [i35] [c44] [c43] [i30] [c35] [i25] [i21] [j2] [c31] [c30] [i20] [c28] [c26] [c25] [i19] [i18] [c21] [c20] [c18] [i17] [i16] [i14] [c16] [c15] [i9] [i8] [c13] [c12] [i6] [c8] [c4] [c3] [c2] [i2] [c1] [i1]
Bernardo Machado David
aka: Bernardo David
aka: Bernardo David
Thomas P. Jakobsen
aka: Thomas Pelle Jakobsen
aka: Thomas Pelle Jakobsen
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
