The following pages link to Jesper Buus Nielsen (Q290394):
Displayed 50 items.
- Signature schemes secure against hard-to-invert leakage (Q290397) (← links)
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) (← links)
- Yes, there is an oblivious RAM lower bound! (Q1784105) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Lower bounds for leakage-resilient secret sharing (Q2055623) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- Afgjort: a partially synchronous finality layer for blockchains (Q2106626) (← links)
- Fast threshold ECDSA with honest majority (Q2106655) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Weight-based Nakamoto-style blockchains (Q2146099) (← links)
- Universally composable subversion-resilient cryptography (Q2170002) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Continuous non-malleable codes in the 8-split-state model (Q2292659) (← links)
- Communication lower bounds for statistically secure MPC, with or without preprocessing (Q2304978) (← links)
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures (Q2304992) (← links)
- Maliciously secure oblivious linear function evaluation with constant overhead (Q2412886) (← links)
- Random-index PIR and applications (Q2697885) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
- Limits on the Power of Cryptographic Cheap Talk (Q2845678) (← links)
- Secure Key Management in the Cloud (Q2870099) (← links)
- A New Approach to Practical Active-Secure Two-Party Computation (Q2914295) (← links)
- Actively Secure Two-Party Evaluation of Any Quantum Operation (Q2914301) (← links)
- Faster Maliciously Secure Two-Party Computation Using the GPU (Q2922667) (← links)
- Compact VSS and Efficient Homomorphic UC Commitments (Q2936610) (← links)
- Additively Homomorphic UC Commitments with Optimal Amortized Overhead (Q2941207) (← links)
- A Tamper and Leakage Resilient von Neumann Architecture (Q2941211) (← links)
- On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation (Q2947524) (← links)
- Adaptive versus Static Security in the UC Model (Q2948135) (← links)
- Superposition Attacks on Cryptographic Protocols (Q2948260) (← links)
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge (Q2948383) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Perfectly Secure Oblivious RAM without Random Oracles (Q3000537) (← links)
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications (Q3011901) (← links)
- Lower and Upper Bounds for Deniable Public-Key Encryption (Q3102181) (← links)
- (Q3149671) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Privacy-Enhancing Auctions Using Rational Cryptography (Q3183584) (← links)
- On the Necessary and Sufficient Assumptions for UC Computation (Q3408190) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation (Q3448807) (← links)
- Secure Protocols with Asymmetric Trust (Q3498386) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries (Q3582784) (← links)
- Simplified Threshold RSA with Adaptive and Proactive Security (Q3593121) (← links)
- Universally Composable Multiparty Computation with Partially Isolated Parties (Q3611774) (← links)
- LEGO for Two-Party Secure Computation (Q3611777) (← links)
- Scalable and Unconditionally Secure Multiparty Computation (Q3612571) (← links)