( en | de | ru )

 

Disambiguation of "Damgård, Ivan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Communication Required for Unconditionally Secure Multiplication.

, , , and . CRYPTO (2), volume 9815 of Lecture Notes in Computer Science, page 459-488. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Constantin Romulus Ivan

Sarah Ivanovas

Svilen Ivanov

Elizaveta Ivanova

Oxana Ivanova-Chessex

 

Other publications of authors with the same name

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack., , , and . EUROCRYPT (1), volume 10210 of Lecture Notes in Computer Science, page 479-500. (2017)Stronger Notions and Constructions for Multi-Designated Verifier Signatures., , , , , and . IACR Cryptology ePrint Archive, (2019)On the Theory and Practice of Personal Digital Signatures., and . Public Key Cryptography, volume 5443 of Lecture Notes in Computer Science, page 277-296. Springer, (2009)Linear Integer Secret Sharing and Distributed Exponentiation., and . Public Key Cryptography, volume 3958 of Lecture Notes in Computer Science, page 75-90. Springer, (2006)Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings., , and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 799-829. Springer, (2018)Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $Z/p^kZ $., , , , , , and . ASIACRYPT (3), volume 12493 of Lecture Notes in Computer Science, page 151-180. Springer, (2020)Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions., , and . Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, page 354-373. Springer, (2000)Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks., , and . IACR Cryptol. ePrint Arch., (2021)Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes., and . IACR Cryptology ePrint Archive, (2000)Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor., and . IACR Cryptology ePrint Archive, (2001)