Ivan Damgård

International Association for Cryptologic Research

Ivan Damgård Search web for home page

Program Committees

1	2013	TCC	pc
2	2012	Crypto	pc
3	2012	CHES	pc
4	2010	Eurocrypt	pc
5	2009	TCC	pc
6	2007	TCC	pc
7	2006	Crypto	pc
8	2004	Eurocrypt	pc
9	2003	Asiacrypt	pc
10	2002	Eurocrypt	pc
11	2000	Asiacrypt	pc
12	1999	Crypto	pc
13	1997	Crypto	pc
14	1996	Eurocrypt	pc
15	1993	Eurocrypt	pc
16	1992	Crypto	pc
17	1990	Eurocrypt	pc chair
18	1988	Eurocrypt	pc

Publications

	year	title	booktitle	pages
1	2012	DDH-Like Assumptions Based on Extension Rings	pkc	644-661
2	2012	Secure Two-Party Computation with Low Communication	tcc	54-74
3	2012	Multiparty Computation from Somewhat Homomorphic Encryption	crypto	643-662
4	2011	Semi-Homomorphic Encryption and Multiparty Computation	eurocrypt	169
5	2011	Perfectly Secure Oblivious RAM Without Random Oracles	tcc	144
6	2010	Efficient, Robust and Constant-Round Distributed RSA Key Generation	tcc	183-200
7	2010	On the Necessary and Sufficient Assumptions for UC Computation	tcc	109-127
8	2010	From Passive to Covert Security at Low Cost	tcc	128-145
9	2010	Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems	tcc	201-218
10	2010	Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost	crypto	558-576
11	2010	Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost	eprint	online
12	2010	Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography	eurocrypt	445-465
13	2010	Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography	eprint	online
14	2010	Perfectly Secure Oblivious RAM Without Random Oracles	eprint	online
15	2009	Asynchronous Multiparty Computation: Theory and Implementation	pkc	160-179
16	2009	On the Theory and Practice of Personal Digital Signatures	pkc	277-296
17	2009	Improving the Security of Quantum Protocols via Commit-and-Open	crypto	408-427
18	2009	On the Amortized Complexity of Zero-Knowledge Protocols	crypto	177-191
19	2009	Quantum-Secure Coin-Flipping and Applications	asiacrypt	52-69
20	2009	Universally Composable Multiparty Computation with Partially Isolated Parties	tcc	315-331
21	2008	Scalable Multiparty Computation with Nearly Optimal Work and Resilience	crypto	241-261
22	2008	A correction to ``Efficient and Secure Comparison for On-Line Auctions''	eprint	online
23	2008	Multiparty Computation Goes Live	eprint	online
24	2008	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eurocrypt	509-526
25	2008	Essentially Optimal Universally Composable Oblivious Transfer	eprint	online
26	2008	Efficient Conversion of Secret-shared Values Between Different Fields	eprint	online
27	2007	Non-interactive Proofs for Integer Multiplication	eurocrypt	412-429
28	2007	Secure Identification and QKD in the Bounded-Quantum-Storage Model	eprint	online
29	2007	A Tight High-Order Entropic Quantum Uncertainty Relation With Applications	eprint	online
30	2007	Isolated Proofs of Knowledge and Isolated Zero Knowledge	eprint	online
31	2007	Universally Composable Multiparty Computation with Partially Isolated Parties	eprint	online
32	2007	Non-Interactive Proofs for Integer Multiplication	eprint	online
33	2007	Atomic Secure Multi-party Multiplication with Low Communication	eurocrypt	329-346
34	2007	Secure Identification and QKD in the Bounded-Quantum-Storage Model	crypto	342-359
35	2007	A Tight High-Order Entropic Quantum Uncertainty Relation with Applications	crypto	360-378
36	2007	Scalable and Unconditionally Secure Multiparty Computation	crypto	572-590
37	2007	Secure Protocols with Asymmetric Trust	asiacrypt	357-375
38	2006	Linear Integer Secret Sharing and Distributed Exponentiation	eprint	online
39	2006	Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation	tcc	online
40	2006	Non-interactive Zero-Knowledge from Homomorphic Encryption	tcc	online
41	2006	Linear Integer Secret Sharing and Distributed Exponentiation	pkc	online
42	2006	Oblivious Transfer and Linear Functions	crypto	online
43	2006	Scalable Secure Multiparty Computation	crypto	online
44	2006	Unclonable Group Identification	eurocrypt	online
45	2006	An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate	jofc	489-520
46	2006	Simplified Threshold RSA with Adaptive and Proactive Security	eurocrypt	online
47	2006	RFID Security: Tradeoffs between Security and Efficiency	eprint	online
48	2005	Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation	tcc	online
49	2005	Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator	eprint	online
50	2005	Cryptography In the Bounded Quantum-Storage Model	eprint	online
51	2005	Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions	pkc	online
52	2005	Universally Composable Disk Encryption Schemes	eprint	online
53	2005	Oblivious Transfer and Linear Functions	eprint	online
54	2005	How to Split a Shared Secret into Shared Bits in Constant-Round	eprint	online
55	2005	Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator	crypto	online
56	2005	A Quantum Cipher with Near Optimal Key-Recycling	crypto	online
57	2005	Unclonable Group Identification	eprint	online
58	2004	Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation	tcc	223-237
59	2004	Unfair Noisy Channels and Oblivious Transfer	tcc	355-373
60	2004	Adaptive versus Non-Adaptive Security of Multi-Party Protocols	jofc	153-207
61	2004	On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-way Quantum Transmission	eprint	online
62	2004	Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks	crypto	online
63	2004	On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission	eurocrypt	online
64	2003	Non-interactive and Reusable Non-malleable Commitment Schemes	eprint	online
65	2003	Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption	crypto	online
66	2002	Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups	eprint	online
67	2002	Client/Server Tradeoffs for Online Elections	pkc	125-140
68	2002	A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order	asiacrypt	online
69	2002	Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security	crypto	online
70	2002	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	crypto	online
71	2002	Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups	eurocrypt	online
72	2001	A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System	pkc	119-136
73	2001	On Adaptive vs. Non-adaptive Security of Multiparty Protocols	eurocrypt	262-279
74	2001	Multiparty Computation from Threshold Homomorphic Encryption	eurocrypt	280-299
75	2001	Secure Distributed Linear Algebra in a Constant Number of Rounds	crypto	119-136
76	2001	On adaptive vs. non-adaptive security of multiparty protocols	eprint	online
77	2001	On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase	crypto	503-523
78	2001	Practical Threshold RSA Signatures without a Trusted Dealer	eurocrypt	152-165
79	2001	An Integer Commitment Scheme based on Groups with Hidden Order	eprint	online
80	2001	Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor	eprint	online
81	2001	An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates	eprint	online
82	2000	Short Non-Interactive Cryptographic Proofs	jofc	449-472
83	2000	Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes	asiacrypt	331-345
84	2000	Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes	eprint	online
85	2000	Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions	pkc	354-373
86	2000	General Secure Multi-Party Computation from any Linear Secret Sharing Scheme	eprint	online
87	2000	On the Complexity of Verifiable Secret Sharing and Multi-Party Computation	eprint	online
88	2000	Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions	eprint	online
89	2000	Multiparty Computation from Threshold Homomorphic Encryption	eprint	online
90	2000	General Secure Multi-party Computation from any Linear Secret-Sharing Scheme	eurocrypt	316-334
91	2000	Improved Non-committing Encryption Schemes Based on a General Complexity Assumption	crypto	432-450
92	2000	Efficient Concurrent Zero-Knowledge in the Auxiliary String Model	eurocrypt	418-430
93	1999	An error in the mixed adversary protocol by Fitzi, Hirt and Maurer	eprint	online
94	1999	Verifiable Encryption and Applications to Group Signatures and Signature Sharing	eprint	online
95	1999	Concurrent Zero-Knowledge is Easy in Practice	eprint	online
96	1999	Efficient Multiparty Computations Secure Against an Adaptive Adversary	eurocrypt	311-326
97	1999	On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions	eurocrypt	56-73
98	1998	Zero-Knowledge Authentication Scheme with Secret Key Exchange	jofc	147-159
99	1998	Two-Key Triple Encryption	jofc	209-218
100	1998	Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?	crypto	424-441
101	1997	On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures	jofc	163-194
102	1997	Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation	eurocrypt	75-87
103	1996	On Monotone Function Closure of Statistical Zero-Knowledge	eprint	online
104	1996	Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments	eprint	online
105	1996	New Generation of Secure and Practical RSA-Based Signatures	crypto	173-185
106	1996	New Convertible Undeniable Signature Schemes	eurocrypt	372-386
107	1995	Practical and Provably Secure Release of a Secret and Exchange of Signatures	jofc	201-222
108	1995	Escure Signature Schemes based on Interactive Protocols	crypto	297-310
109	1995	Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs	crypto	325-338
110	1994	Parallel Divertibility of Proofs of Knowledge (Extended Abstract)	eurocrypt	140-155
111	1994	Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols	crypto	174-187
112	1993	Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract)	crypto	100-109
113	1993	On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures	crypto	250-265
114	1993	Practical and Provably Secure Release of a Secret and Exchange of Signatures	eurocrypt	200-217
115	1993	The Breaking of the AR Hash Function	eurocrypt	286-292
116	1992	Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract)	eurocrypt	461-466
117	1992	On Generation of Probable Primes By Incremental Search	crypto	358-370
118	1992	Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing	eurocrypt	341-355
119	1991	Speeding up Prime Number Generation	asiacrypt	440-449
120	1991	Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks	crypto	445-456
121	1990	Convertible Undeniable Signatures	crypto	189-205
122	1989	On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs	crypto	17-27
123	1989	A Design Principle for Hash Functions	crypto	416-427
124	1988	Anonymous and Verifiable Registration in Databases	eurocrypt	167-176
125	1988	Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract)	crypto	583-588
126	1988	"Practical IP" <= MA	crypto	580-582
127	1988	On the Randomness of Legendre and Jacobi Sequences	crypto	163-172
128	1988	Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals	crypto	328-335
129	1987	Multiparty Unconditionally Secure Protocols (Abstract)	crypto	462
130	1987	Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result	crypto	87-119
131	1987	Gradual and Verifiable Release of a Secret	crypto	156-166
132	1987	Collision Free Hash Functions and Public Key Signature Schemes	eurocrypt	203-216

Ivan Damgård Search web for home page

Program Committees

Publications

Coauthors of Ivan Damgård