Ronald Cramer

International Association for Cryptologic Research

Ronald Cramer Search web for home page

Program Committees

1	2012	TCC	pc chair
2	2011	TCC	pc
3	2008	PKC	pc chair
4	2007	TCC	general chair
5	2005	Eurocrypt	pc chair
6	2004	Crypto	pc
7	2004	TCC	pc
8	2003	Eurocrypt	pc
9	2003	Crypto	pc
10	2001	Asiacrypt	pc
11	2000	Eurocrypt	pc
12	2000	Crypto	pc
13	1999	Crypto	pc

Publications

	year	title	booktitle	pages
1	2012	DDH-Like Assumptions Based on Extension Rings	pkc	644-661
2	2011	The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing	crypto	682
3	2011	The Arithmetic Codex: Theory and Applications	eurocrypt	1
4	2010	A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems	tcc	146-164
5	2009	Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field	crypto	466-486
6	2009	On the Amortized Complexity of Zero-Knowledge Protocols	crypto	177-191
7	2008	Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors	eprint	online
8	2008	Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves	eurocrypt	451-470
9	2008	Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors	eurocrypt	471-488
10	2007	Bounded CCA2-Secure Encryption	asiacrypt	502-518
11	2007	Secure Computation from Random Error Correcting Codes	eurocrypt	291-310
12	2007	Atomic Secure Multi-party Multiplication with Low Communication	eurocrypt	329-346
13	2007	A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra	crypto	613-630
14	2006	Asymptotically Optimal Two-Round Perfectly Secure Message Transmission	crypto	online
15	2006	Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields	crypto	online
16	2006	A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security	eprint	online
17	2005	Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation	tcc	online
18	2005	On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes	crypto	online
19	2005	Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields	crypto	online
20	2004	Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation	tcc	223-237
21	2004	On codes, matroids and secure multi-party computation from linear secret sharing schemes	eprint	online
22	2003	Efficient Multi-party Computation over Rings	eurocrypt	online
23	2003	Efficient Multi-Party Computation over Rings	eprint	online
24	2002	Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments	asiacrypt	online
25	2002	Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups	eprint	online
26	2002	Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption	eurocrypt	online
27	2002	Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups	crypto	online
28	2001	Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack	eprint	online
29	2001	Multiparty Computation from Threshold Homomorphic Encryption	eurocrypt	280-299
30	2001	Secure Distributed Linear Algebra in a Constant Number of Rounds	crypto	119-136
31	2001	On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase	crypto	503-523
32	2001	Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption	eprint	online
33	2000	Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions	pkc	354-373
34	2000	General Secure Multi-Party Computation from any Linear Secret Sharing Scheme	eprint	online
35	2000	On the Complexity of Verifiable Secret Sharing and Multi-Party Computation	eprint	online
36	2000	Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions	eprint	online
37	2000	Multiparty Computation from Threshold Homomorphic Encryption	eprint	online
38	2000	General Secure Multi-party Computation from any Linear Secret-Sharing Scheme	eurocrypt	316-334
39	1999	Signature Schemes Based on the Strong RSA Assumption	eprint	online
40	1999	Efficient Multiparty Computations Secure Against an Adaptive Adversary	eurocrypt	311-326
41	1998	A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack	eprint	online
42	1998	Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?	crypto	424-441
43	1998	A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack	crypto	13-25
44	1997	Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation	eurocrypt	75-87
45	1997	A Secure and Optimally Efficient Multi-Authority Election Scheme	eurocrypt	103-118
46	1996	On Monotone Function Closure of Statistical Zero-Knowledge	eprint	online
47	1996	Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments	eprint	online
48	1996	Multi-Autority Secret-Ballot Elections with Linear Work	eurocrypt	72-83
49	1996	New Generation of Secure and Practical RSA-Based Signatures	crypto	173-185
50	1995	Escure Signature Schemes based on Interactive Protocols	crypto	297-310
51	1994	Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols	crypto	174-187
52	1993	Improved Privacy in Wallets with Observers (Extended Abstract)	eurocrypt	329-343

Ronald Cramer Search web for home page

Program Committees

Publications

Coauthors of Ronald Cramer