Search

Your search keyword '"Damgard, Ivan"' showing total 591 results

Search Constraints

Start Over You searched for: Author "Damgard, Ivan" Remove constraint Author: "Damgard, Ivan"
591 results on '"Damgard, Ivan"'

Search Results

1. A system capable of verifiably and privately screening global DNA synthesis

2. Differentially Private Selection from Secure Distributed Computing

3. An Improved Threshold Homomorphic Cryptosystem Based on Class Groups

4. Broadcast-Optimal Four-Round MPC in the Plain Model

5. Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels

7. Minimizing Setup in Broadcast-Optimal Two Round MPC

8. Vector Commitments over Rings and Compressed -Protocols

10. On Access Control Encryption Without Sanitization

11. Improved Single-Round Secure Multiplication Using Regenerating Codes

12. Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries

13. Broadcast-Optimal Two Round MPC with an Honest Majority

14. Oblivious TLS via Multi-party Computation

15. Balancing Privacy and Accountability in Blockchain Identity Management

16. Two-Round n-out-of-n and Multi-signatures and Trapdoor Commitment from Lattices

17. Random adversarial threshold search enables automated DNA screening

18. Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over

19. Stronger Security and Constructions of Multi-designated Verifier Signatures

20. Fast Threshold ECDSA with Honest Majority

21. Black-Box Transformations from Passive to Covert Security with Public Verifiability

22. Access Control Encryption: Enforcing Information Flow with Cryptography

23. Efficient Information-Theoretic Secure Multiparty Computation over via Galois Rings

24. Commodity-Based 2PC for Arithmetic Circuits

25. Efficient UC Commitment Extension with Homomorphism for Free (and Applications)

26. Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures

27. Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

28. Proofs of Replicated Storage Without Timing Assumptions

29. More Efficient Commitments from Structured Lattice Assumptions

30. Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings

31. SPD for Dishonest Majority

32. Compact Zero-Knowledge Proofs of Small Hamming Weight

33. Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments

34. Confidential Benchmarking Based on Multiparty Computation

35. Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model

36. Resource-Efficient OT Combiners with Active Security

37. Secure Arithmetic Computation with Constant Computational Overhead

38. The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited

39. Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack

40. Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement

41. How to Prove Knowledge of Small Secrets

42. Rate-1, Linear Time and Additively Homomorphic UC Commitments

43. On the Communication Required for Unconditionally Secure Multiplication

44. Unconditionally Secure Computation with Reduced Interaction

45. On Public Key Encryption from Noisy Codewords

46. Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)

47. Better Preprocessing for Secure Multiparty Computation

48. Non-Interactive Verifiable Secret Sharing for Monotone Circuits

49. Fast Oblivious AES A Dedicated Application of the MiniMac Protocol

50. Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions

Catalog

Books, media, physical & digital resources