The following pages link to Jesper Buus Nielsen (Q290394):
Displayed 36 items.
- Asynchronous Multiparty Computation: Theory and Implementation (Q3617519) (← links)
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement (Q3646243) (← links)
- Secure Multiparty Computation Goes Live (Q3655178) (← links)
- (Q4409113) (← links)
- (Q4409132) (← links)
- (Q4409136) (← links)
- (Q4409144) (← links)
- (Q4536817) (← links)
- Signature Schemes Secure against Hard-to-Invert Leakage (Q4911580) (← links)
- On the Connection between Leakage Tolerance and Adaptive Security (Q4916027) (← links)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions (Q4924431) (← links)
- On the theoretical gap between synchronous and asynchronous MPC protocols (Q5176200) (← links)
- Lower Bounds for Oblivious Data Structures (Q5236338) (← links)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Q5385737) (← links)
- Leakage-Resilient Signatures with Graceful Degradation (Q5402981) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428124) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428142) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation (Q5451065) (← links)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge (Q5458611) (← links)
- Secure Multiparty Computation and Secret Sharing (Q5500574) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Predictable Arguments of Knowledge (Q5738785) (← links)
- Non-malleable Codes with Split-State Refresh (Q5738791) (← links)
- Fully Leakage-Resilient Codes (Q5738793) (← links)
- Unconditionally Secure Computation with Reduced Interaction (Q5739210) (← links)
- Continuous Non-malleable Codes (Q5746349) (← links)
- Robust Multiparty Computation with Linear Communication Complexity (Q5756628) (← links)
- Theory of Cryptography (Q5898360) (← links)
- Continuously non-malleable codes with split-state refresh (Q5915693) (← links)
- Continuously non-malleable codes with split-state refresh (Q5915916) (← links)
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles (Q6061369) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- Public randomness extraction with ephemeral roles and worst-case corruptions (Q6097259) (← links)
- Formalizing delayed adaptive corruptions and the security of flooding networks (Q6104341) (← links)
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees (Q6135431) (← links)