Ivan Bjerre Damgård
Artificial Intelligence · 1987–2019
A researcher in the Science corpus: 24 papers; trusts 59 researchers and is trusted by 198 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 116 citations into it; #2,074 of 36,961 by trust here, #2,226 by citations
- Computational Theory and Mathematics — 76 citations into it; #230 of 12,489 by trust here, #174 by citations
- Computer Networks and Communications — 60 citations into it
- Information Systems — 48 citations into it; #692 of 9,233 by trust here, #724 by citations
- Privacy & Security — 48 citations into it; #28 of 710 by trust here, #50 by citations
- Algorithms & Complexity — 17 citations into it
- Computer Vision and Pattern Recognition — 16 citations into it
- Discrete Mathematics and Combinatorics — 15 citations into it
Whom Ivan Bjerre Damgård trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Ran Canetti
- Ronald Cramer
- Fabrice Boudot
- Victor Shoup
- Pascal Paillier
- Craig Gentry
- Shafi Goldwasser
- Nigel P. Smart
- Dan Boneh
- Marcel Keller
Who trusts Ivan Bjerre Damgård overall
- Marcel Keller
- Yehuda Lindell
- Helger Lipmaa
- Jens Groth
- Slawomir Goryczka
- Rosario Gennaro
- Takashi Nishide
- Jan Camenisch
- Craig Gentry
- Keith B. Frikken
Papers from Ivan Bjerre Damgård's perspective
Ordered by how strongly the researchers Ivan Bjerre Damgård trusts endorse each paper. Same corpus, a different order for every researcher.
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Learning Multiple Layers of Features from Tiny Images
- New Directions in Cryptography
- Random oracles are practical: a paradigm for designing efficient protocols
- Probabilistic Encryption
- How to share a secret
- Fairplay - Secure Two-Party Computation System
- Fair exchange with a semi-trusted third party (extended abstract)
- ImageNet classification with deep convolutional neural networks
- Protocols for secure computations
Their papers
- New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning (2019) — 182 citations
- Multiparty Computation from Somewhat Homomorphic Encryption (2012) — 1,492 citations
- Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits (2013) — 552 citations
- Multiparty Computation from Threshold Homomorphic Encryption (2000) — 669 citations
- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation (2005) — 312 citations
- Secure Multiparty Computation Goes Live (2009) — 606 citations
- Semi-Homomorphic Encryption and Multiparty Computation (2011) — 435 citations
- Efficient Concurrent Zero-Knowledge in the Auxiliary String Model (2000) — 332 citations
- Scalable and Unconditionally Secure Multiparty Computation (2007) — 330 citations
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order (2002) — 331 citations
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme (2000) — 599 citations
- SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority (2018) — 192 citations
- A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System (2001) — 1,135 citations
- A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System (2000) — 395 citations
- Secure Multiparty Computation and Secret Sharing (2015) — 530 citations
- SPD Z 2 k : Efficient MPC mod 2 k for Dishonest Majority To appear at CRYPTO 2018 (2018)
- Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol (2012) — 74 citations
- Efficient, Robust and Constant-Round Distributed RSA Key Generation (2010) — 55 citations
- A correction to 'efficient and secure comparison for on-line auctions' (2009) — 124 citations
- Multiparty Computation Goes Live (2008) — 63 citations