The following pages link to Ivan B. Damgård (Q1272335):
Displayed 50 items.
- New Convertible Undeniable Signature Schemes (Q2876916) (← links)
- Secure Computation, I/O-Efficient Algorithms and Distributed Signatures (Q2890013) (← links)
- Secure Two-Party Computation with Low Communication (Q2891476) (← links)
- DDH-Like Assumptions Based on Extension Rings (Q2900250) (← links)
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions (Q2912785) (← links)
- Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol (Q2912800) (← links)
- Multiparty Computation from Somewhat Homomorphic Encryption (Q2914293) (← links)
- Publicly Auditable Secure Multi-Party Computation (Q2922659) (← links)
- An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation (Q2922672) (← links)
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits (Q2925559) (← links)
- Compact VSS and Efficient Homomorphic UC Commitments (Q2936610) (← links)
- Additively Homomorphic UC Commitments with Optimal Amortized Overhead (Q2941207) (← links)
- On the Security of Distributed Multiprime RSA (Q2942824) (← links)
- On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation (Q2947524) (← links)
- The Chaining Lemma and Its Application (Q2947530) (← links)
- Adaptive versus Static Security in the UC Model (Q2948135) (← links)
- Superposition Attacks on Cryptographic Protocols (Q2948260) (← links)
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions (Q2948388) (← links)
- Perfectly Secure Oblivious RAM without Random Oracles (Q3000537) (← links)
- Quantum Communication Attacks on Classical Cryptographic Protocols (Q3002113) (← links)
- Semi-homomorphic Encryption and Multiparty Computation (Q3003382) (← links)
- (Q3043932) (← links)
- Average Case Error Estimates for the Strong Probable Prime Test (Q3137458) (← links)
- (Q3149671) (← links)
- Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement (Q3179358) (← links)
- Access Control Encryption: Enforcing Information Flow with Cryptography (Q3181040) (← links)
- On the Amortized Complexity of Zero-Knowledge Protocols (Q3183564) (← links)
- Improving the Security of Quantum Protocols via Commit-and-Open (Q3183577) (← links)
- On the complexity of verifiable secret sharing and multiparty computation (Q3192000) (← links)
- (Q3212279) (← links)
- (Q3212280) (← links)
- (Q3374918) (← links)
- (Q3374926) (← links)
- On the Necessary and Sufficient Assumptions for UC Computation (Q3408190) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- Efficient, Robust and Constant-Round Distributed RSA Key Generation (Q3408194) (← links)
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
- New Generation of Secure and Practical RSA-Based Signatures (Q3452350) (← links)
- Secure Protocols with Asymmetric Trust (Q3498386) (← links)
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography (Q3506407) (← links)
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation (Q3524129) (← links)
- Theory and Practice of Multiparty Computation (Q3541900) (← links)
- Cryptography in the Bounded-Quantum-Storage Model (Q3549326) (← links)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Q3563850) (← links)
- Non-interactive and reusable non-malleable commitment schemes (Q3581303) (← links)
- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost (Q3582777) (← links)
- Secure Multiparty AES (Q3583564) (← links)
- Unclonable Group Identification (Q3593118) (← links)
- Simplified Threshold RSA with Adaptive and Proactive Security (Q3593121) (← links)
- Efficient and Secure Comparison for On-Line Auctions (Q3608937) (← links)