• What's new
• Archive
• Paper awards
• Videos
• Authors
• Coauthors
• By year
• By venue
• All Committees
• Most Committees
• Report errors
• About

Ueli Maurer  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2018	But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin	eurocrypt	34-65
2	2018	On Composable Security for Digital Signatures	pkc	494-523
3	2018	Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio	tcc	345-369
4	2018	Topology-Hiding Computation Beyond Semi-Honest Adversaries	tcc	3-35
5	2017	Bitcoin as a Transaction Ledger: A Composable Treatment	crypto	324-356
6	2017	Strengthening Access Control Encryption	asiacrypt	502-532
7	2016	Network-Hiding Communication and Applications to Multi-party Protocols	crypto	335-365
8	2016	From Indifferentiability to Constructive Cryptography (and Back)	tcc	3-24
9	2015	Robust Authenticated Encryption and the Limits of Symmetric Cryptography	eprint	893
10	2015	Query-Complexity Amplification for Random Oracles	eprint	315
11	2015	Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer	eprint	394
12	2015	Idealizing Identity-Based Encryption	eprint	862
13	2015	From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes	tcc	online
14	2015	Idealizing Identity-Based Encryption	asiacrypt	online
15	2014	Broadcast Amplification	tcc	online
16	2014	Key-Indistinguishable Message Authentication Codes	eprint	107
17	2014	(De-)Constructing TLS	eprint	20
18	2014	Optimality of Non-Adaptive Strategies: The Case of Parallel Games	eprint	299
19	2014	From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes	eprint	324
20	2014	Anonymous Authentication with Shared Secrets	eprint	73
21	2013	Universally Composable Synchronous Computation	TCC	online
22	2013	A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation	crypto	online
23	2013	Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited	asiacrypt	online
24	2013	Resource-Restricted Indifferentiability	eurocrypt	online
25	2012	Confidentiality and Integrity: A Constructive Perspective	tcc	online
26	2012	Collusion-Preserving Computation	crypto	online
27	2011	The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy	asiacrypt	online
28	2010	A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch	tcc	online
29	2009	Cascade Encryption Revisited	eprint	online
30	2009	Realistic Failures in Secure Multi-party Computation	tcc	online
31	2009	Cascade Encryption Revisited	asiacrypt	online
32	2009	Combining Computational and Information-Theoretic Security in Multi-Party Computation	eprint	online
33	2009	Breaking RSA Generically Is Equivalent to Factoring	eurocrypt	36-53
34	2009	Abstraction in Cryptography	crypto	online
35	2009	Computational Indistinguishability Amplification: Tight Product Theorems for System Composition	crypto	online
36	2008	MPC vs. SFE: Perfect Security in a Unified Corruption Model	tcc	online
37	2008	FACTORING IS EQUIVALENT TO GENERIC RSA	eprint	online
38	2008	Breaking RSA Generically is Equivalent to Factoring	eprint	online
39	2008	MPC vs. SFE : Unconditional and Computational Security	asiacrypt	1-18
40	2008	Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography	asiacrypt	online
41	2007	Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations	asiacrypt	online
42	2007	Indistinguishability Amplification	crypto	online
43	2007	Domain Extension of Public Random Functions: Beyond the Birthday Barrier	crypto	online
44	2007	A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security	eurocrypt	online
45	2007	MPC vs. SFE: Perfect Security in a Unified Corruption Model	eprint	online
46	2007	Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations	eprint	online
47	2007	Domain Extension of Public Random Functions: Beyond the Birthday Barrier	eprint	online
48	2006	Luby-Rackoff Ciphers from Weak Round Functions?	eurocrypt	online
49	2006	A Fast and Key-Efficient Reduction of Chosen- Ciphertext to Known-Plaintext Security	eprint	online
50	2006	Luby-Rackoff Ciphers from Weak Round Functions?	eprint	online
51	2006	Indistinguishability Amplification	eprint	online
52	2005	Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order	pkc	online
53	2005	Byzantine Agreement Given Partial Broadcast	jofc	191-217
54	2005	Minimal Complete Primitives for Secure Multi-Party Computation	jofc	37-61
55	2004	Complete Classification of Bilinear Hard-Core Functions	crypto	online
56	2004	On Generating the Initial Key in the Bounded-Storage Model	eurocrypt	online
57	2004	Composition of Random Systems: When Two Weak Make One Strong	tcc	410-427
58	2004	Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology	tcc	21-39
59	2004	Optimal Randomizer Efficiency in the Bounded-Storage Model	jofc	5-26
60	2003	The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations	eurocrypt	online
61	2003	Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology	eprint	online
62	2002	Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks	crypto	online
63	2002	Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch	eurocrypt	online
64	2002	Indistinguishability of Random Systems	eurocrypt	online
65	2001	Minimal Complete Primitives for Secure Multi-party Computation	crypto	online
66	2001	Robustness for Free in Unconditional Multi-party Computation	crypto	online
67	2001	Robustness for Free in Unconditional Multi-Party Computation	eprint	online
68	2000	Efficient Secure Multi-party Computation	asiacrypt	143-161
69	2000	General Secure Multi-party Computation from any Linear Secret-Sharing Scheme	eurocrypt	online
70	2000	Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free	eurocrypt	online
71	2000	Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence	pkc	93-112
72	2000	General Secure Multi-Party Computation from any Linear Secret Sharing Scheme	eprint	online
73	2000	Player Simulation and General Adversary Structures in Perfect Multiparty Computation	jofc	31-60
74	1999	General Adversaries in Unconditional Multi-party Computation	asiacrypt	232-246
75	1999	Information-Theoretic Cryptography	crypto	47-64
76	1998	Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)	crypto	121-136
77	1998	Lower Bounds on Generic Algorithms in Groups	eurocrypt	72-84
78	1997	Unconditional Security Against Memory-Bounded Adversaries	crypto	292-306
79	1997	Privacy Amplification Secure Against Active Adversaries	crypto	307-321
80	1997	Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion	eurocrypt	209-225
81	1997	Linking Information Reconciliation and Privacy Amplification	jofc	97-110
82	1996	On the Efficiency of One-Time Digital Signatures	asiacrypt	145-158
83	1996	Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible	asiacrypt	196-209
84	1996	Diffie-Hellman Oracles	crypto	268-282
85	1995	Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters	jofc	123-155
86	1994	Directed Acyclic Graphs, One-way Functions and Digital Signatures	crypto	75-82
87	1994	Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms	crypto	271-281
88	1994	Linking Information Reconciliation and Privacy Amplification (Extended Abstract)	eurocrypt	266-274
89	1993	Cascade Ciphers: The Importance of Being First	jofc	55-61
90	1992	Protocols for Secret Key Agreement by Public Discussion Based on Common Information	crypto	461-470
91	1992	A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator	eurocrypt	239-255
92	1992	Factoring with an Oracle	eurocrypt	429-436
93	1992	A Remark on a Non-interactive Public-Key Distribution System	eurocrypt	458-460
94	1992	Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher	jofc	53-66
95	1992	A Universal Statistical Test for Random Bit Generators	jofc	89-105
96	1991	New Public-Key Schemes Based on Elliptic Curves over the Ring Zn	crypto	252-266
97	1991	New Approaches to the Design of Self-Synchronizing Stream Ciphers	eurocrypt	458-471
98	1991	Non-interactive Public-Key Cryptography	eurocrypt	498-507
99	1991	Local Randomness in Pseudorandom Sequences	jofc	135-149
100	1990	A Universal Statistical Test for Random Bit Generators	crypto	409-420
101	1990	A Provably-Secure Strongly-Randomized Cipher	eurocrypt	361-373
102	1989	Perfect Local Randomness in Pseudo-Random Sequences	crypto	100-112
103	1989	Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity	eurocrypt	636-647
104	1987	Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers	eurocrypt	237-247

Coauthors of Ueli Maurer

1. Divesh Aggarwal (4)
2. Joël Alwen (3)
3. Christian Badertscher (6)
4. Endre Bangerter (1)
5. Zuzana Beerliová-Trubíniová (2)
6. Daniel Bleichenbacher (2)
7. Christian Cachin (3)
8. Jan Camenisch (1)
9. Jeffrey Considine (1)
10. Sandro Coretti (3)
11. Ronald Cramer (2)
12. Ivan Damgård (2)
13. Grégory Demay (1)
14. Gregory Demay (2)
15. Stefan Dziembowski (2)
16. Serge Fehr (1)
17. Matthias Fitzi (8)
18. Matthew K. Franklin (1)
19. Juan A. Garay (3)
20. Peter Gaži (5)
21. Nicolas Gisin (1)
22. Sarah Hauser (1)
23. Martin Hirt (15)
24. Dennis Hofheinz (2)
25. Thomas Holenstein (1)
26. Clemens Holenstein (2)
27. Daniel Jost (1)
28. Jonathan Katz (2)
29. Reto Kohlas (1)
30. Markulf Kohlweiss (1)
31. Kenji Koyama (1)
32. Rio LaVigne (1)
33. Leonid A. Levin (1)
34. Chen-Da Liu-Zhang (1)
35. Christoph Lucas (2)
36. James L. Massey (4)
37. Christian Matt (5)
38. David Metcalf (1)
39. Tal Moran (1)
40. Marta Mularczyk (1)
41. Tatsuaki Okamoto (1)
42. Cristina Onete (1)
43. Rafail Ostrovsky (2)
44. Yvonne Anne Oswald (2)
45. Arpita Patra (2)
46. Krzysztof Pietrzak (6)
47. Bartosz Przydatek (1)
48. Dominik Raub (3)
49. Pavel Raykov (3)
50. Renato Renner (5)
51. João L. Ribeiro (1)
52. Phillip Rogaway (2)
53. Oliver von Rotz (1)
54. Andreas Rüedlinger (1)
55. Johan Sjödin (5)
56. Björn Tackmann (11)
57. Stefano Tessaro (5)
58. Daniel Tschudi (4)
59. Scott A. Vanstone (1)
60. Daniele Venturi (3)
61. Muzhong Wang (1)
62. Stefan Wolf (5)
63. Yacov Yacobi (2)
64. Vassilis Zikas (9)