Ueli M. Maurer

International Association for Cryptologic Research

Ueli M. Maurer Search web for home page

Program Committees

1	2010	TCC	general chair
2	2008	TCC	pc
3	2003	PKC	pc
4	2000	Asiacrypt	pc
5	1999	Asiacrypt	pc
6	1998	Crypto	pc
7	1996	Eurocrypt	pc chair
8	1995	Eurocrypt	pc
9	1994	Eurocrypt	pc
10	1992	Crypto	pc
11	1991	Crypto	pc

Publications

	year	title	booktitle	pages
1	2012	Confidentiality and Integrity: A Constructive Perspective	tcc	209-229
2	2012	Collusion-Preserving Computation	crypto	124-143
3	2011	The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy	asiacrypt	686-701
4	2010	A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch	tcc	237-254
5	2009	Cascade Encryption Revisited	eprint	online
6	2009	Combining Computational and Information-Theoretic Security in Multi-Party Computation	eprint	online
7	2009	Abstraction in Cryptography	crypto	465
8	2009	Computational Indistinguishability Amplification: Tight Product Theorems for System Composition	crypto	355-373
9	2009	Cascade Encryption Revisited	asiacrypt	37-51
10	2009	Breaking RSA Generically Is Equivalent to Factoring	eurocrypt	36-53
11	2009	Realistic Failures in Secure Multi-party Computation	tcc	274-293
12	2008	FACTORING IS EQUIVALENT TO GENERIC RSA	eprint	online
13	2008	MPC vs. SFE: Perfect Security in a Unified Corruption Model	tcc	231-250
14	2008	MPC vs. SFE : Unconditional and Computational Security	asiacrypt	1-18
15	2008	Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography	asiacrypt	161-178
16	2008	Breaking RSA Generically is Equivalent to Factoring	eprint	online
17	2007	A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security	eurocrypt	498-516
18	2007	MPC vs. SFE: Perfect Security in a Unified Corruption Model	eprint	online
19	2007	Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations	eprint	online
20	2007	Indistinguishability Amplification	crypto	130-149
21	2007	Domain Extension of Public Random Functions: Beyond the Birthday Barrier	crypto	187-204
22	2007	Domain Extension of Public Random Functions: Beyond the Birthday Barrier	eprint	online
23	2007	Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations	asiacrypt	427-443
24	2006	A Fast and Key-Efficient Reduction of Chosen- Ciphertext to Known-Plaintext Security	eprint	online
25	2006	Luby-Rackoff Ciphers from Weak Round Functions?	eurocrypt	online
26	2006	Indistinguishability Amplification	eprint	online
27	2006	Luby-Rackoff Ciphers from Weak Round Functions?	eprint	online
28	2005	Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order	pkc	online
29	2005	Minimal Complete Primitives for Secure Multi-Party Computation	jofc	37-61
30	2005	Byzantine Agreement Given Partial Broadcast	jofc	191-217
31	2004	On Generating the Initial Key in the Bounded-Storage Model	eurocrypt	online
32	2004	Composition of Random Systems: When Two Weak Make One Strong	tcc	410-427
33	2004	Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology	tcc	21-39
34	2004	Complete Classification of Bilinear Hard-Core Functions	crypto	online
35	2004	Optimal Randomizer Efficiency in the Bounded-Storage Model	jofc	5-26
36	2003	The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations	eurocrypt	online
37	2003	Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology	eprint	online
38	2002	Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks	crypto	online
39	2002	Indistinguishability of Random Systems	eurocrypt	online
40	2002	Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch	eurocrypt	online
41	2001	Minimal Complete Primitives for Secure Multi-party Computation	crypto	80-100
42	2001	Robustness for Free in Unconditional Multi-party Computation	crypto	101-118
43	2001	Robustness for Free in Unconditional Multi-Party Computation	eprint	online
44	2000	Efficient Secure Multi-party Computation	asiacrypt	143-161
45	2000	Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free	eurocrypt	351-368
46	2000	Player Simulation and General Adversary Structures in Perfect Multiparty Computation	jofc	31-60
47	2000	General Secure Multi-Party Computation from any Linear Secret Sharing Scheme	eprint	online
48	2000	General Secure Multi-party Computation from any Linear Secret-Sharing Scheme	eurocrypt	316-334
49	2000	Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence	pkc	93-112
50	1999	Information-Theoretic Cryptography	crypto	47-64
51	1999	General Adversaries in Unconditional Multi-party Computation	asiacrypt	232-246
52	1998	Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract)	crypto	121-136
53	1998	Lower Bounds on Generic Algorithms in Groups	eurocrypt	72-84
54	1997	Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion	eurocrypt	209-225
55	1997	Linking Information Reconciliation and Privacy Amplification	jofc	97-110
56	1997	Privacy Amplification Secure Against Active Adversaries	crypto	307-321
57	1997	Unconditional Security Against Memory-Bounded Adversaries	crypto	292-306
58	1996	Diffie-Hellman Oracles	crypto	268-282
59	1996	Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible	asiacrypt	196-209
60	1996	On the Efficiency of One-Time Digital Signatures	asiacrypt	145-158
61	1995	Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters	jofc	123-155
62	1994	Directed Acyclic Graphs, One-way Functions and Digital Signatures	crypto	75-82
63	1994	Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms	crypto	271-281
64	1994	Linking Information Reconciliation and Privacy Amplification (Extended Abstract)	eurocrypt	266-274
65	1993	Cascade Ciphers: The Importance of Being First	jofc	55-61
66	1992	A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator	eurocrypt	239-255
67	1992	Factoring with an Oracle	eurocrypt	429-436
68	1992	A Remark on a Non-interactive Public-Key Distribution System	eurocrypt	458-460
69	1992	Protocols for Secret Key Agreement by Public Discussion Based on Common Information	crypto	461-470
70	1992	Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher	jofc	53-66
71	1992	A Universal Statistical Test for Random Bit Generators	jofc	89-105
72	1991	New Approaches to the Design of Self-Synchronizing Stream Ciphers	eurocrypt	458-471
73	1991	Non-interactive Public-Key Cryptography	eurocrypt	498-507
74	1991	Local Randomness in Pseudorandom Sequences	jofc	135-149
75	1991	New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n	crypto	252-266
76	1990	A Provably-Secure Strongly-Randomized Cipher	eurocrypt	361-373
77	1990	A Universal Statistical Test for Random Bit Generators	crypto	409-420
78	1989	Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity	eurocrypt	636-647
79	1989	Perfect Local Randomness in Pseudo-Random Sequences	crypto	100-112
80	1987	Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers	eurocrypt	237-247

Ueli M. Maurer Search web for home page

Program Committees

Publications

Coauthors of Ueli M. Maurer