Jesper Buus Nielsen
Orcid: 0000-0002-7074-0683Affiliations:
- Aarhus University
According to our database1,
Jesper Buus Nielsen
authored at least 133 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on cs.au.dk
On csauthors.net:
Bibliography
2024
IACR Cryptol. ePrint Arch., 2024
2023
Byzantine Agreement Decomposed: Honest Majority Asynchronous Total-Order Broadcast from Reliable Broadcast.
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the Public-Key Cryptography - PKC 2023, 2023
2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022
Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022
2021
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer.
J. Cryptol., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
IACR Cryptol. ePrint Arch., 2021
Proceedings of the Theory of Cryptography - 19th International Conference, 2021
Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021
2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020
2019
IACR Cryptol. ePrint Arch., 2019
Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing.
IACR Cryptol. ePrint Arch., 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019
2018
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.
IACR Cryptol. ePrint Arch., 2018
Electron. Colloquium Comput. Complex., 2018
2017
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model.
Theor. Comput. Sci., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation.
IACR Cryptol. ePrint Arch., 2017
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.
Electron. Colloquium Comput. Complex., 2017
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
2016
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Proceedings of the Theory of Cryptography - 14th International Conference, 2016
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016
2015
IACR Cryptol. ePrint Arch., 2015
TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation.
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015
Cambridge University Press, ISBN: 9781107043053, 2015
2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation.
IACR Cryptol. ePrint Arch., 2014
On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
2013
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
2012
IACR Cryptol. ePrint Arch., 2012
2011
J. Chem. Inf. Model., 2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
A sub-cubic time algorithm for computing the quartet distance between two general trees.
Algorithms Mol. Biol., 2011
Algorithms for a Parallel Implementation of Hidden Markov Models with a Small State Space.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
2010
A generalization of Paillier's public-key system with applications to electronic voting.
Int. J. Inf. Sec., 2010
IACR Cryptol. ePrint Arch., 2010
Algorithms Mol. Biol., 2010
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010
Proceedings of the Advances in Cryptology, 2010
2009
IACR Cryptol. ePrint Arch., 2009
On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees.
Proceedings of the International Joint Conferences on Bioinformatics, 2009
Proceedings of the Financial Cryptography and Data Security, 2009
Proceedings of the Advances in Cryptology, 2009
2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
SNPFile - A software library and file format for large scale association mapping and population genetics studies.
BMC Bioinform., 2008
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Advances in Cryptology, 2008
2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
Proceedings of the Advances in Cryptology, 2007
Proceedings of the Advances in Cryptology, 2007
2006
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006
Proceedings of the Advances in Cryptology, 2006
2005
IACR Cryptol. ePrint Arch., 2005
Electron. Colloquium Comput. Complex., 2005
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract).
Proceedings of the Advances in Cryptology, 2005
2004
IACR Cryptol. ePrint Arch., 2004
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.
IACR Cryptol. ePrint Arch., 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption.
Proceedings of the Advances in Cryptology, 2003
2002
Proceedings of the Advances in Cryptology, 2002
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case.
Proceedings of the Advances in Cryptology, 2002
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security.
Proceedings of the Advances in Cryptology, 2002
2001
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor.
IACR Cryptol. ePrint Arch., 2001
2000
IACR Cryptol. ePrint Arch., 2000
Proceedings of the Advances in Cryptology, 2000