Dominique Unruh

International Association for Cryptologic Research

Dominique Unruh Search web for home page

Program Committees

1	2017	Crypto	pc
2	2016	Eurocrypt	pc
3	2016	Asiacrypt	pc
4	2015	Asiacrypt	pc
5	2014	Eurocrypt	pc
6	2014	PKC	pc
7	2012	Crypto	pc
8	2011	TCC	pc

Publications

	year	title	booktitle	pages
1	2016	Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms	tcc	192-216
2	2016	Computationally Binding Quantum Commitments	eurocrypt	497-527
3	2016	Collapse-Binding Quantum Commitments Without Random Oracles	asiacrypt	online
4	2015	Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model	eurocrypt	755-784
5	2015	Computationally binding quantum commitments	eprint	361
6	2014	Quantum Position Verification in the Random Oracle Model	crypto	1-18
7	2014	Revocable Quantum Timed-Release Encryption	eurocrypt	129-146
8	2014	Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding	eprint	296
9	2014	Quantum position verification in the random oracle model	eprint	118
10	2014	Non-interactive zero-knowledge proofs in the quantum random oracle model	eprint	587
11	2013	Everlasting Multi-party Computation	crypto	380-397
12	2012	Security of Blind Signatures Revisited	pkc	662-679
13	2012	Quantum Proofs of Knowledge	eurocrypt	135-152
14	2011	Round Optimal Blind Signatures in the Standard Model	crypto	627
15	2011	Concurrent composition in the bounded quantum storage model	eurocrypt	467
16	2010	Computationally Sound Verification of Source Code	eprint	online
17	2010	Quantum Proofs of Knowledge	eprint	online
18	2010	Concurrent composition in the bounded quantum storage model	eprint	online
19	2010	Universally Composable Incoercibility	crypto	411-428
20	2010	Long-Term Security and Universal Composability	jofc	594-671
21	2010	Universally Composable Quantum Multi-party Computation	eurocrypt	486-505
22	2010	The impossibility of computationally sound XOR	eprint	online
23	2009	A general framework for computational soundness proofs - or - The computational soundness of the applied pi-calculus	eprint	online
24	2009	Polynomial Runtime and Composability	eprint	online
25	2008	OAEP Is Secure under Key-Dependent Messages	asiacrypt	506-523
26	2008	Limits of Constructive Security Proofs	asiacrypt	290-307
27	2008	Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers	eprint	online
28	2008	Towards Key-Dependent Message Security in the Standard Model	eurocrypt	108-126
29	2007	Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol	eprint	online
30	2007	Towards Key-Dependent Message Security in the Standard Model	eprint	online
31	2007	On the Necessity of Rewinding in Secure Multiparty Computation	tcc	157-173
32	2007	Long-Term Security and Universal Composability	tcc	41-60
33	2007	Random Oracles and Auxiliary Input	crypto	205-223
34	2007	Random Oracles and Auxiliary Input	eprint	online
35	2007	On the Security of Protocols with Logarithmic Communication Complexity	eprint	online
36	2006	On the Necessity of Rewinding in Secure Multiparty Computation	eprint	online
37	2006	Simulatable Security and Polynomially Bounded Concurrent Composition	eprint	online
38	2006	Long-term Security and Universal Composability	eprint	online
39	2006	On the (Im-)Possibility of Extending Coin Toss	eprint	online
40	2006	On the (Im-)Possibility of Extending Coin Toss	eurocrypt	online
41	2005	On the Notion of Statistical Security in Simulatability Definitions	eprint	online
42	2005	On Fairness in Simulatability-based Cryptographic Systems	eprint	online
43	2005	Comparing Two Notions of Simulatability	tcc	online
44	2005	Relations amount Statistical Security Notions - or - Why Exponential Adversaries are Unlimited	eprint	online

Dominique Unruh Search web for home page

Program Committees

Publications

Coauthors of Dominique Unruh