Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvan Damgård
Ivan Bjerre Damgård
Person information
- affiliation: Aarhus University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c186]Jakob Burkhardt, Ivan Damgård, Tore Kasper Frederiksen, Satrajit Ghosh, Claudio Orlandi:
Improved Distributed RSA Key Generation Using the Miller-Rabin Test. CCS 2023: 2501-2515- [c185]Ivan Damgård, Daniel Escudero, Antigoni Polychroniadou:
Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. ITC 2023: 7:1-7:21 - [c184]Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov:
Secure Communication in Dynamic Incomplete Networks. ITC 2023: 13:1-13:21 - [c183]Lennart Braun
, Ivan Damgård, Claudio Orlandi:
Secure Multiparty Computation from Threshold Encryption Based on Class Groups. CRYPTO (1) 2023: 613-645 - [c182]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Minimizing Setup in Broadcast-Optimal Two Round MPC. EUROCRYPT (2) 2023: 129-158 - [c181]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. LATINCRYPT 2023: 87-106 - [i135]Ivan Damgård, Hannah Keller, Boel Nelson, Claudio Orlandi, Rasmus Pagh:
Differentially Private Selection from Secure Distributed Computing. CoRR abs/2306.04564 (2023) - [i134]Ivan Damgård, Divya Ravi, Daniel Tschudi, Sophia Yakoubov:
Secure Communication in Dynamic Incomplete Networks. IACR Cryptol. ePrint Arch. 2023: 529 (2023) - [i133]Jakob Burkhardt, Ivan Damgård, Tore Kasper Frederiksen, Satrajit Ghosh, Claudio Orlandi:
Improved Distributed RSA Key Generation Using the Miller-Rabin Test. IACR Cryptol. ePrint Arch. 2023: 644 (2023) - [i132]Ivan Damgård, Hannah Keller, Boel Nelson, Claudio Orlandi, Rasmus Pagh:
Differentially Private Selection from Secure Distributed Computing. IACR Cryptol. ePrint Arch. 2023: 894 (2023) - [i131]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. IACR Cryptol. ePrint Arch. 2023: 1187 (2023) - 2022
- [j21]Ivan Damgård, Thomas P. Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergaard:
Fast threshold ECDSA with honest majority. J. Comput. Secur. 30(1): 167-196 (2022) - [j20]Ivan Damgård, Claudio Orlandi, Akira Takahashi, Mehdi Tibouchi:
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. J. Cryptol. 35(2): 14 (2022) - [c180]Damiano Abram, Ivan Damgård, Claudio Orlandi, Peter Scholl:
An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. CRYPTO (4) 2022: 421-452 - [c179]Cecilia Boschini, Ivan Damgård, Claudio Orlandi:
On Access Control Encryption Without Sanitization. SCN 2022: 220-243 - [c178]Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Damgård, Daniel Escudero:
Vector Commitments over Rings and Compressed $\varSigma $-Protocols. TCC (1) 2022: 173-202 - [i130]Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Bjerre Damgård, Daniel Escudero:
Vector Commitments over Rings and Compressed Σ-Protocols. IACR Cryptol. ePrint Arch. 2022: 181 (2022) - [i129]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Minimizing Setup in Broadcast-Optimal Two Round MPC. IACR Cryptol. ePrint Arch. 2022: 293 (2022) - [i128]Damiano Abram, Ivan Damgård, Claudio Orlandi, Peter Scholl:
An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. IACR Cryptol. ePrint Arch. 2022: 363 (2022) - [i127]Cecilia Boschini, Ivan Damgård, Claudio Orlandi:
On Access Control Encryption without Sanitization. IACR Cryptol. ePrint Arch. 2022: 854 (2022) - [i126]Lennart Braun, Ivan Damgård, Claudio Orlandi:
Secure Multiparty Computation from Threshold Encryption based on Class Groups. IACR Cryptol. ePrint Arch. 2022: 1437 (2022) - 2021
- [c177]Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing:
Improved Single-Round Secure Multiplication Using Regenerating Codes. ASIACRYPT (2) 2021: 222-244 - [c176]Ivan Bjerre Damgård, Boyang Li, Nikolaj Ignatieff Schwartzbach:
More Communication Lower Bounds for Information-Theoretic MPC. ITC 2021: 2:1-2:18 - [c175]Ivan Bjerre Damgård, Kasper Green Larsen, Sophia Yakoubov:
Broadcast Secret-Sharing, Bounds and Applications. ITC 2021: 10:1-10:20 - [c174]Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with an Honest Majority. CRYPTO (2) 2021: 155-184 - [c173]Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger:
Oblivious TLS via Multi-party Computation. CT-RSA 2021: 51-74 - [c172]Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi:
Balancing Privacy and Accountability in Blockchain Identity Management. CT-RSA 2021: 552-576 - [c171]Ivan Damgård, Claudio Orlandi, Akira Takahashi, Mehdi Tibouchi:
Two-Round n-out-of-n and Multi-signatures and Trapdoor Commitment from Lattices. Public Key Cryptography (1) 2021: 99-130 - [c170]Ivan Damgård, Daniel Escudero, Divya Ravi:
Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. TCC (1) 2021: 591-622 - [i125]Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing:
Improved single-round secure multiplication using regenerating codes. IACR Cryptol. ePrint Arch. 2021: 253 (2021) - [i124]Ivan Damgård, Boyang Li, Nikolaj I. Schwartzbach:
More Communication Lower Bounds for Information-Theoretic MPC. IACR Cryptol. ePrint Arch. 2021: 278 (2021) - [i123]Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger:
Oblivious TLS via Multi-Party Computation. IACR Cryptol. ePrint Arch. 2021: 318 (2021) - [i122]Ivan Damgård, Daniel Escudero, Divya Ravi:
Information-Theoretically Secure MPC against Mixed Dynamic Adversaries. IACR Cryptol. ePrint Arch. 2021: 1163 (2021) - [i121]Ivan Damgård, Daniel Escudero, Antigoni Polychroniadou:
Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. IACR Cryptol. ePrint Arch. 2021: 1376 (2021) - 2020
- [c169]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan:
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. ASIACRYPT (3) 2020: 151-180 - [c168]Ivan Damgård, Claudio Orlandi, Mark Simkin:
Black-Box Transformations from Passive to Covert Security with Public Verifiability. CRYPTO (2) 2020: 647-676 - [c167]Ivan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergård:
Fast Threshold ECDSA with Honest Majority. SCN 2020: 382-400 - [c166]Ivan Damgård, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov:
Stronger Security and Constructions of Multi-designated Verifier Signatures. TCC (2) 2020: 229-260 - [i120]Ivan Damgård, Nikolaj I. Schwartzbach:
Communication Lower Bounds for Perfect Maliciously Secure MPC. IACR Cryptol. ePrint Arch. 2020: 251 (2020) - [i119]Ivan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergård:
Fast Threshold ECDSA with Honest Majority. IACR Cryptol. ePrint Arch. 2020: 501 (2020) - [i118]Ivan Damgård, Sophia Yakoubov:
Bounds on Ad Hoc Threshold Encryption. IACR Cryptol. ePrint Arch. 2020: 618 (2020) - [i117]Ivan Damgård, Claudio Orlandi, Mark Simkin:
Black-Box Transformations from Passive to Covert Security with Public Verifiability. IACR Cryptol. ePrint Arch. 2020: 916 (2020) - [i116]Ivan Damgård, Claudio Orlandi, Akira Takahashi, Mehdi Tibouchi:
Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. IACR Cryptol. ePrint Arch. 2020: 1110 (2020) - [i115]Ivan Damgård, Bernardo Magri, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with an Honest Majority. IACR Cryptol. ePrint Arch. 2020: 1254 (2020) - [i114]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan:
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. IACR Cryptol. ePrint Arch. 2020: 1256 (2020) - [i113]Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi:
Balancing Privacy and Accountability in Blockchain Transactions. IACR Cryptol. ePrint Arch. 2020: 1511 (2020)
2010 – 2019
- 2019
- [c165]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). ASIACRYPT (2) 2019: 606-635 - [c164]Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen:
Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. CRYPTO (2) 2019: 61-84 - [c163]Ivan Damgård, Chaya Ganesh, Claudio Orlandi:
Proofs of Replicated Storage Without Timing Assumptions. CRYPTO (1) 2019: 355-380 - [c162]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) 2019: 510-539 - [c161]Ivan Damgård, Helene Haagh, Michael Nielsen, Claudio Orlandi:
Commodity-Based 2PC for Arithmetic Circuits. IMACC 2019: 154-177 - [c160]Ivan Damgård, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev:
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. IEEE Symposium on Security and Privacy 2019: 1102-1120 - [c159]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan:
Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings. TCC (1) 2019: 471-501 - [i112]Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen:
Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing. IACR Cryptol. ePrint Arch. 2019: 220 (2019) - [i111]Ivan Damgård, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev:
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. IACR Cryptol. ePrint Arch. 2019: 599 (2019) - [i110]Ivan Damgård, Helene Haagh, Michael Nielsen, Claudio Orlandi:
Commodity-Based 2PC for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2019: 705 (2019) - [i109]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan:
Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings. IACR Cryptol. ePrint Arch. 2019: 872 (2019) - [i108]Ivan Damgård, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov:
Stronger Notions and Constructions for Multi-Designated Verifier Signatures. IACR Cryptol. ePrint Arch. 2019: 1153 (2019) - 2018
- [c158]Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing:
SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. CRYPTO (2) 2018: 769-798 - [c157]Ivan Damgård, Claudio Orlandi, Mark Simkin:
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. CRYPTO (2) 2018: 799-829 - [c156]Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin:
Compact Zero-Knowledge Proofs of Small Hamming Weight. Public Key Cryptography (2) 2018: 530-560 - [c155]Carsten Baum, Ivan Damgård, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert:
More Efficient Commitments from Structured Lattice Assumptions. SCN 2018: 368-385 - [c154]Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi:
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. TCC (2) 2018: 225-254 - [i107]Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing:
SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. IACR Cryptol. ePrint Arch. 2018: 482 (2018) - [i106]Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi:
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. IACR Cryptol. ePrint Arch. 2018: 596 (2018) - [i105]Ivan Damgård, Chaya Ganesh, Claudio Orlandi:
Proofs of Replicated Storage Without Timing Assumptions. IACR Cryptol. ePrint Arch. 2018: 654 (2018) - [i104]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). IACR Cryptol. ePrint Arch. 2018: 983 (2018) - [i103]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. IACR Cryptol. ePrint Arch. 2018: 1147 (2018) - 2017
- [j19]Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. J. Cryptol. 30(1): 152-190 (2017) - [c153]Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci:
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. CRYPTO (1) 2017: 167-187 - [c152]Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron:
Secure Arithmetic Computation with Constant Computational Overhead. CRYPTO (1) 2017: 223-254 - [c151]Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan:
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. EUROCRYPT (1) 2017: 479-500 - [c150]Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing:
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. ICITS 2017: 1-25 - [c149]Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci:
Resource-Efficient OT Combiners with Active Security. TCC (2) 2017: 461-486 - [i102]Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci:
Resource-efficient OT combiners with active security. IACR Cryptol. ePrint Arch. 2017: 545 (2017) - [i101]Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron:
Secure Arithmetic Computation with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2017: 617 (2017) - [i100]Ivan Damgård, Claudio Orlandi, Mark Simkin:
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. IACR Cryptol. ePrint Arch. 2017: 908 (2017) - [i99]Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin:
Compact Zero-Knowledge Proofs of Small Hamming Weight. IACR Cryptol. ePrint Arch. 2017: 1041 (2017) - 2016
- [j18]Giuseppe Ateniese, Özgür Dagdelen, Ivan Damgård, Daniele Venturi:
Entangled cloud storage. Future Gener. Comput. Syst. 62: 104-118 (2016) - [c148]Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Better Preprocessing for Secure Multiparty Computation. ACNS 2016: 327-345 - [c147]Ge Bai, Ivan Damgård, Claudio Orlandi, Yu Xia:
Non-Interactive Verifiable Secret Sharing for Monotone Circuits. AFRICACRYPT 2016: 225-244 - [c146]Ivan Damgård, Rasmus Winther Zakarias:
Fast Oblivious AES A Dedicated Application of the MiniMac Protocol. AFRICACRYPT 2016: 245-264 - [c145]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. CRYPTO (3) 2016: 179-207 - [c144]Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin:
On the Communication Required for Unconditionally Secure Multiplication. CRYPTO (2) 2016: 459-488 - [c143]Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen:
How to Prove Knowledge of Small Secrets. CRYPTO (3) 2016: 478-498 - [c142]Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén:
Unconditionally Secure Computation with Reduced Interaction. EUROCRYPT (2) 2016: 420-447 - [c141]Ivan Damgård, Kasper Damgård, Kurt Nielsen, Peter Sebastian Nordholt, Tomas Toft:
Confidential Benchmarking Based on Multiparty Computation. Financial Cryptography 2016: 169-187 - [c140]Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao:
Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE). Public Key Cryptography (2) 2016: 208-233 - [c139]Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. Public Key Cryptography (2) 2016: 417-446 - [c138]Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci:
Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. TCC (B1) 2016: 204-234 - [c137]Ivan Damgård, Helene Haagh, Claudio Orlandi:
Access Control Encryption: Enforcing Information Flow with Cryptography. TCC (B2) 2016: 547-576 - [i98]Ivan Damgård, Helene Haagh, Claudio Orlandi:
Access Control Encryption: Enforcing Information Flow with Cryptography. CoRR abs/1602.03642 (2016) - [i97]Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Better Preprocessing for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2016: 48 (2016) - [i96]Ge Bai, Ivan Damgård, Claudio Orlandi, Yu Xia:
Non-Interactive Verifiable Secret Sharing For Monotone Circuits. IACR Cryptol. ePrint Arch. 2016: 78 (2016) - [i95]Ivan Damgård, Helene Haagh, Claudio Orlandi:
Access Control Encryption: Enforcing Information Flow with Cryptography. IACR Cryptol. ePrint Arch. 2016: 106 (2016) - [i94]Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Fast Multiparty Multiplications from shared bits. IACR Cryptol. ePrint Arch. 2016: 109 (2016) - [i93]Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci:
Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement. IACR Cryptol. ePrint Arch. 2016: 120 (2016) - [i92]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2016: 137 (2016) - [i91]Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing:
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. IACR Cryptol. ePrint Arch. 2016: 397 (2016) - [i90]Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen:
How to prove knowledge of small secrets. IACR Cryptol. ePrint Arch. 2016: 538 (2016) - [i89]Ronald Cramer, Ivan Damgård:
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. IACR Cryptol. ePrint Arch. 2016: 681 (2016) - [i88]Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci:
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation. IACR Cryptol. ePrint Arch. 2016: 695 (2016) - [i87]Carsten Baum, Ivan Damgård, Sabine Oechsner, Chris Peikert:
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. IACR Cryptol. ePrint Arch. 2016: 997 (2016) - 2015
- [b2]Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen:
Secure Multiparty Computation and Secret Sharing. Cambridge University Press 2015, ISBN 9781107043053 - [c136]Giuseppe Ateniese, Özgür Dagdelen, Ivan Damgård, Daniele Venturi:
Entangled Encodings and Data Entanglement. SCC@ASIACCS 2015: 3-12 - [c135]Marcin Andrychowicz, Ivan Damgård, Stefan Dziembowski, Sebastian Faust, Antigoni Polychroniadou:
Efficient Leakage Resilient Circuit Compilers. CT-RSA 2015: 311-329 - [c134]Ronald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, Gabriele Spini:
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. EUROCRYPT (2) 2015: 313-336 - [c133]Ivan Damgård, Frédéric Dupuis, Jesper Buus Nielsen:
On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation. ICITS 2015: 87-104 - [c132]Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
The Chaining Lemma and Its Application. ICITS 2015: 181-196 - [c131]Ignacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC Commitments with Optimal Amortized Overhead. Public Key Cryptography 2015: 495-515 - [i86]Eli Ben-Sasson, Iddo Bentov, Ivan Bjerre Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. Electron. Colloquium Comput. Complex. TR15 (2015) - [i85]Ronald Cramer, Ivan Damgård, Marcel Keller:
On the Amortized Complexity of Zero-knowledge Protocols. IACR Cryptol. ePrint Arch. 2015: 446 (2015) - [i84]Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. IACR Cryptol. ePrint Arch. 2015: 572 (2015) - [i83]Ivan Damgård, Jesper Buus Nielsen:
Unconditionally Secure Computation with Reduced Interaction. IACR Cryptol. ePrint Arch. 2015: 630 (2015) - [i82]Ivan Damgård, Rasmus Winther Zakarias:
Fast Oblivious AES\\A dedicated application of the MiniMac protocol. IACR Cryptol. ePrint Arch. 2015: 989 (2015) - [i81]Ivan Damgård, Kasper Damgård, Kurt Nielsen, Peter Sebastian Nordholt, Tomas Toft:
Confidential Benchmarking based on Multiparty Computation. IACR Cryptol. ePrint Arch. 2015: 1006 (2015) - [i80]