Ivan Damgård

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Differentially Private Selection from Secure Distributed Computing 2024 Ivan Damgård
Hannah Keller
Boel Nelson
Claudio Orlandi
Rasmus Pagh
+ PDF Chat A system capable of verifiably and privately screening global DNA synthesis 2024 Carsten Baum
Jens Berlips
W Q Chen
Hongrui Cui
Ivan Damgård
Jiangbin Dong
Kevin M. Esvelt
Mingyu Gao
Dana Gretton
Leonard Foner
+ Differentially Private Selection from Secure Distributed Computing 2023 Ivan Damgård
Hannah Keller
Boel Nelson
Claudio Orlandi
Rasmus Pagh
+ Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. 2016 Ronald Cramer
Ivan Damgård
Nico Döttling
Irene Giacomelli
Chaoping Xing
+ Access Control Encryption: Enforcing Information Flow with Cryptography 2016 Ivan Damgård
Helene Haagh
Claudio Orlandi
+ Access Control Encryption: Enforcing Information Flow with Cryptography 2016 Ivan Damgård
Helene Haagh
Claudio Orlandi
+ Preliminaries 2015 Ronald Cramer
Ivan Damgård
Jesper Buus Nielsen
+ Information-Theoretic Robust MPC Protocols 2015 Ronald Cramer
Ivan Damgård
Jesper Buus Nielsen
+ Preface 2015 Ronald Cramer
Ivan Damgård
Jesper Buus Nielsen
+ Algebraic Preliminaries 2015 Ronald Cramer
Ivan Damgård
Jesper Buus Nielsen
+ Secure identification and QKD in the bounded-quantum-storage model 2014 Ivan Damgård
Serge Fehr
Louis Salvail
Christian Schaffner
+ PDF Chat Superposition Attacks on Cryptographic Protocols 2014 Ivan Damgård
Jakob Funder
Jesper Buus Nielsen
Louis Salvail
+ Efficient Multiparty Protocols via Log-Depth Threshold Formulae. 2013 Gil Cohen
Ivan Damgård
Yuval Ishai
Jonas Kölker
Peter Bro Miltersen
Ran Raz
Ron D. Rothblum
+ On Generation of Probable Primes by Incremental Search 2007 Jørgen Brandt
Ivan Damgård
+ A Tight High-Order Entropic Quantum Uncertainty Relation With Applications 2006 Ivan Damgård
Serge Fehr
Renato Renner
Louis Salvail
Christian Schaffner
+ PDF Chat Cryptography In the Bounded Quantum-Storage Model 2005 Ivan Damgård
Serge Fehr
Louis Salvail
Christian Schaffner
+ PDF Chat Cryptography in the Bounded Quantum Storage Model 2005 Ivan Damgård
Serge Fehr
Louis Salvail
Christian Schaffner
+ Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation 2005 Ronald Cramer
Ivan Damgård
Yuval Ishai
+ On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-way Quantum Transmission 2004 Ivan Damgård
Thomas B. Pedersen
Louis Salvail
+ PDF Chat Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers 2003 Ivan Damgård
Gudmund Skovbjerg Frandsen
+ Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups 2002 Ivan Damgård
Maciej Koprowski
+ Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. 2002 Ivan Damgård
Maciej Koprowski
+ Practical Threshold RSA Signatures without a Trusted Dealer 2001 Ivan Damgård
Maciej Koprowski
+ An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. 2001 Ivan Damgård
Gudmund Skovbjerg Frandsen
+ PDF Chat Statistical Secrecy and Multi-Bit Commitments 1996 Ivan Damgård
Torben Pedersen
Birgit Pfitzmann
+ PDF Chat Average case error estimates for the strong probable prime test 1993 Ivan Damgård
Peter Landrock
Carl Pomerance
+ Concatenated group codes and their exponents 1987 Ivan Damgård
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Simple Proof of Security of the BB84 Quantum Key Distribution Protocol 2000 Peter W. Shor
John Preskill
3
+ PDF Chat Cryptography In the Bounded Quantum-Storage Model 2005 Ivan Damgård
Serge Fehr
Louis Salvail
Christian Schaffner
3
+ PDF Chat Security against individual attacks for realistic quantum key distribution 2000 Norbert Lütkenhaus
2
+ PDF Chat Cryptographic distinguishability measures for quantum-mechanical states 1999 Christopher A. Fuchs
J. van de Graaf
2
+ PDF Chat Weighted sums of certain dependent random variables 1967 Kazuoki Azuma
2
+ PDF Chat Unconditionally Secure Quantum Bit Commitment is Impossible 1997 Dominic Mayers
2
+ PDF Chat SECURITY OF QUANTUM KEY DISTRIBUTION 2008 Renato Renner
2
+ PDF Chat Formulation of the uncertainty relations in terms of the Rényi entropies 2006 Iwo Białynicki‐Birula
2
+ PDF Chat Is Quantum Bit Commitment Really Possible? 1997 Hoi‐Kwong Lo
H. F. Chau
2
+ PDF Chat Insecurity of quantum secure computations 1997 Hoi‐Kwong Lo
2
+ Signature Schemes and Anonymous Credentials from Bilinear Maps 2004 Jan Camenisch
Anna Lysyanskaya
1
+ PDF Chat Limitations on Practical Quantum Cryptography 2000 Gilles Brassard
Norbert Lütkenhaus
Tal Mor
Barry C. Sanders
1
+ On the Number of False Witnesses for a Composite Number 1986 Paul Erdös
Carl Pomerance
1
+ PDF Chat Information-theoretic security proof for quantum-key-distribution protocols 2005 Renato Renner
Nicolas Gisin
Barbara Kraus
1
+ PDF Chat The probability that a random probable prime is composite 1989 Su Hee Kim
Carl Pomerance
1
+ BEYOND STRONG SUBADDITIVITY? IMPROVED BOUNDS ON THE CONTRACTION OF GENERALIZED RELATIVE ENTROPY 1994 Mary Beth Ruskai
1
+ Short monotone formulae for the majority function 1984 Leslie G. Valiant
1
+ PDF Chat The pseudoprimes to 25⋅10⁹ 1980 Carl Pomerance
J. L. Selfridge
Samuel S. Wagstaff
1
+ Divisors of codeword weights 1983 Harold N. Ward
1
+ PDF Chat Complete Insecurity of Quantum Protocols for Classical Two-Party Computation 2012 Harry Buhrman
Matthias Christandl
Christian Schaffner
1
+ PDF Chat A binary algorithm for the Jacobi symbol 1993 Jeffrey Shallit
Jonathan Sorenson
1
+ Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias 1965 Stanley L. Warner
1
+ PDF Chat A ``Binary'' System for Complex Numbers 1965 Walter Penney
1
+ Redundant radix representations of rings 1999 Asger Munk Nielsen
Peter Kornerup
1
+ PDF Chat Experimental implementation of bit commitment in the noisy-storage model 2012 Nelly H. Y. Ng
Siddarth Koduru Joshi
Chia Chen Ming
Christian Kurtsiefer
Stephanie Wehner
1
+ PDF Chat The expectation of success using a Monte Carlo factoring method—some statistics on quadratic class numbers 1984 Duncan A. Buell
1
+ PDF Chat The generation of random numbers that are probably prime 1988 Pierre Beauchemin
Gilles Brassard
Claude Crépeau
Claude Goutier
Carl Pomerance
1
+ PDF Chat On lattices, learning with errors, random linear codes, and cryptography 2005 Oded Regev
1
+ PDF Chat Average case error estimates for the strong probable prime test 1993 Ivan Damgård
Peter Landrock
Carl Pomerance
1
+ PDF Chat Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes 1923 G. H. Hardy
J. E. Littlewood
1
+ PDF Chat Cryptography from Noisy Storage 2008 Stephanie Wehner
Christian Schaffner
Barbara M. Terhal
1
+ Norm Inequalities for Certain Operator Sums 1997 Fuad Kittaneh
1
+ MULTILINEAR FORMS AND DIVISORS OF CODEWORD WEIGHTS 1983 Harold N. Ward
1
+ PDF Chat Mutually unbiased binary observable sets on<i>N</i>qubits 2002 Jay Lawrence
Časlav Brukner
Anton Zeilinger
1
+ Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups 2002 Ivan Damgård
Maciej Koprowski
1
+ A Generic Security Proof for Quantum Key Distribution 2004 Matthias Christandl
Renato Renner
Artur Ekert
1
+ PDF Chat The Bounded-Storage Model in the Presence of a Quantum Adversary 2008 Robert König
Barbara M. Terhal
1
+ On the distribution of primes in short intervals 1976 P. X. Gallagher
1
+ PDF Chat Unconditional Security From Noisy Quantum Storage 2012 Robert König
Stephanie Wehner
Jürg Wullschleger
1
+ PDF Chat Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data 2008 Yevgeniy Dodis
Rafail Ostrovsky
Leonid Reyzin
Adam Smith
1
+ PDF Chat An All-But-One Entropic Uncertainty Relation, and Application to Password-Based Identification 2013 Niek J. Bouman
Serge Fehr
Carlos E. González-Guillén
Christian Schaffner
1
+ PDF Chat Heuristics on class groups of number fields 1984 Henri Cohen
H. W. Lenstra
1
+ PDF Chat The Operational Meaning of Min- and Max-Entropy 2009 Robert König
Renato Renner
Christian Schaffner
1
+ How to Generate Cryptographically Strong Sequences of Pseudorandom Bits 1984 Manuel Blum
Silvio Micali
1
+ PDF Chat Entanglement Cost of Quantum Channels 2013 Mario Berta
Fernando G. S. L. Brandão
Matthias Christandl
Stephanie Wehner
1
+ PDF Chat Principled Evaluation of Differentially Private Algorithms using DPBench 2016 Michael Hay
Ashwin Machanavajjhala
Gerome Miklau
Yan Chen
Dan Zhang
1
+ Quantum-Secure Message Authentication Codes. 2012 Dan Boneh
Mark Zhandry
1
+ PDF Chat Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model 2010 Christian Schaffner
1
+ PDF Chat Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥) 1975 J. Barkley Rosser
Lowell Schoenfeld
1
+ On the randomness of independent experiments 2006 Thomas Holenstein
Renato Renner
1