Jesper Buus Nielsen

From MaRDI portal
Person:290394

Available identifiers

zbMath Open nielsen.jesper-buusWikidataQ60643294 ScholiaQ60643294MaRDI QIDQ290394

List of research outcomes

PublicationDate of PublicationType
On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles2023-12-08Paper
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime2023-11-24Paper
Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees2023-08-25Paper
Formalizing delayed adaptive corruptions and the security of flooding networks2023-06-28Paper
Public randomness extraction with ephemeral roles and worst-case corruptions2023-06-12Paper
Random-index PIR and applications2023-04-13Paper
Afgjort: a partially synchronous finality layer for blockchains2022-12-16Paper
Fast threshold ECDSA with honest majority2022-12-16Paper
Reverse firewalls for actively secure MPCs2022-11-09Paper
Universally composable subversion-resilient cryptography2022-08-30Paper
Weight-based Nakamoto-style blockchains2022-06-15Paper
YOSO: You only speak once. Secure MPC with stateless ephemeral roles2022-04-22Paper
TARDIS: a foundation of time-lock puzzles in UC2021-12-08Paper
Lower bounds for leakage-resilient secret sharing2021-12-01Paper
High-performance multi-party computation for binary circuits based on oblivious transfer2021-08-10Paper
Continuously non-malleable codes in the split-state model2020-11-06Paper
Communication lower bounds for statistically secure MPC, with or without preprocessing2020-03-09Paper
Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures2020-03-09Paper
Continuous non-malleable codes in the 8-split-state model2020-02-04Paper
Lower Bounds for Oblivious Data Structures2019-10-15Paper
Continuously non-malleable codes with split-state refresh2019-01-18Paper
Yes, there is an oblivious RAM lower bound!2018-09-26Paper
Continuously non-malleable codes with split-state refresh2018-08-10Paper
Maliciously secure oblivious linear function evaluation with constant overhead2018-04-06Paper
On the Computational Overhead of MPC with Dishonest Majority2017-06-13Paper
Predictable Arguments of Knowledge2017-06-13Paper
Non-malleable Codes with Split-State Refresh2017-06-13Paper
Fully Leakage-Resilient Codes2017-06-13Paper
Reactive Garbling: Foundation, Instantiation, Application2017-01-06Paper
Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model2016-12-22Paper
Cross and Clean: Amortized Garbled Circuits with Constant Overhead2016-12-21Paper
Rate-1, Linear Time and Additively Homomorphic UC Commitments2016-11-09Paper
On the Communication Required for Unconditionally Secure Multiplication2016-10-27Paper
Unconditionally Secure Computation with Reduced Interaction2016-07-15Paper
Signature schemes secure against hard-to-invert leakage2016-06-01Paper
On the Complexity of Additively Homomorphic UC Commitments2016-03-23Paper
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation2015-10-27Paper
Superposition Attacks on Cryptographic Protocols2015-09-30Paper
Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge2015-09-30Paper
Adaptive versus Static Security in the UC Model2015-09-29Paper
On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation2015-09-24Paper
Additively Homomorphic UC Commitments with Optimal Amortized Overhead2015-08-27Paper
A Tamper and Leakage Resilient von Neumann Architecture2015-08-27Paper
Secure Multiparty Computation and Secret Sharing2015-08-06Paper
On the theoretical gap between synchronous and asynchronous MPC protocols2015-03-02Paper
Compact VSS and Efficient Homomorphic UC Commitments2015-01-06Paper
Faster Maliciously Secure Two-Party Computation Using the GPU2014-10-14Paper
Leakage-Resilient Signatures with Graceful Degradation2014-03-25Paper
Continuous Non-malleable Codes2014-02-18Paper
Secure Key Management in the Cloud2014-01-17Paper
Limits on the Power of Cryptographic Cheap Talk2013-09-02Paper
MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions2013-05-31Paper
On the Connection between Leakage Tolerance and Adaptive Security2013-04-19Paper
Signature Schemes Secure against Hard-to-Invert Leakage2013-03-19Paper
A New Approach to Practical Active-Secure Two-Party Computation2012-09-25Paper
Actively Secure Two-Party Evaluation of Any Quantum Operation2012-09-25Paper
Lower and Upper Bounds for Deniable Public-Key Encryption2011-12-02Paper
Fully Simulatable Quantum-Secure Coin-Flipping and Applications2011-06-29Paper
Perfectly Secure Oblivious RAM without Random Oracles2011-05-19Paper
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries2010-08-24Paper
On the Necessary and Sufficient Assumptions for UC Computation2010-02-24Paper
From Passive to Covert Security at Low Cost2010-02-24Paper
Secure Multiparty Computation Goes Live2010-01-07Paper
On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement2009-11-19Paper
Privacy-Enhancing Auctions Using Rational Cryptography2009-10-20Paper
Asynchronous Multiparty Computation: Theory and Implementation2009-03-24Paper
Scalable and Unconditionally Secure Multiparty Computation2009-03-10Paper
Universally Composable Multiparty Computation with Partially Isolated Parties2009-03-03Paper
LEGO for Two-Party Secure Computation2009-03-03Paper
Asynchronous Multi-Party Computation with Quadratic Communication2008-08-19Paper
Secure Protocols with Asymmetric Trust2008-05-15Paper
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience2008-05-06Paper
Isolated Proofs of Knowledge and Isolated Zero Knowledge2008-04-15Paper
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation2008-03-18Paper
OT-Combiners via Secure Computation2008-03-05Paper
Advances in Cryptology - CRYPTO 20032007-11-28Paper
Advances in Cryptology - CRYPTO 20032007-11-28Paper
Simplified Threshold RSA with Adaptive and Proactive Security2007-09-24Paper
Robust Multiparty Computation with Linear Communication Complexity2007-09-04Paper
Theory of Cryptography2007-02-12Paper
https://portal.mardi4nfdi.de/entity/Q44091132003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q44091322003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q44091362003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q44091442003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q31496712002-09-30Paper
https://portal.mardi4nfdi.de/entity/Q45368172002-08-06Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jesper Buus Nielsen