Oded Goldreich

International Association for Cryptologic Research

Oded Goldreich Search web for home page

Program Committees

1	1992	Crypto	pc
2	1988	Crypto	pc
3	1985	Crypto	pc

Publications

	year	title	booktitle	pages
1	2010	More Constructions of Lossy and Correlation-Secure Trapdoor Functions	pkc	279-295
2	2010	On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits	jofc	1-36
3	2007	On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits	tcc	174-193
4	2006	Session-Key Generation Using Human Passwords Only	jofc	241-340
5	2006	On Expected Probabilistic Polynomial-Time Adversaries -- A suggestion for restricted definitions and their benefits	eprint	online
6	2006	On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge	eprint	online
7	2006	On Post-Modern Cryptography	eprint	online
8	2004	On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes	tcc	40-57
9	2004	Preface	jofc	1-3
10	2004	The Power of Verification Queries in Message Authentication and Authenticated Encryption	eprint	online
11	2003	On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators	jofc	71-93
12	2003	On the random-oracle methodology as applied to length-restricted signature schemes	eprint	online
13	2002	On Chosen Ciphertext Security of Multiple Encryptions	eprint	online
14	2002	The GGM Construction does NOT yield Correlation Intractable Function Ensembles	eprint	online
15	2002	Zero-Knowledge twenty years after its invention	eprint	online
16	2001	Session-Key Generation Using Human Passwords Only	crypto	408-432
17	2001	Resettably-Sound Zero-Knowledge and its Applications	eprint	online
18	2001	On the (Im)possibility of Obfuscating Programs	eprint	online
19	2001	On the (Im)possibility of Obfuscating Programs	crypto	1-18
20	2001	Concurrent Zero-Knowledge With Timing, Revisited	eprint	online
21	2001	Universal Arguments and their Applications	eprint	online
22	2000	Preface	jofc	1-7
23	2000	On Security Preserving Reductions -- Revised Terminology	eprint	online
24	2000	Session-Key Generation using Human Passwords Only	eprint	online
25	2000	Candidate One-Way Functions Based on Expander Graphs	eprint	online
26	2000	On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators	eprint	online
27	1999	Chinese Remaindering with Errors	eprint	online
28	1999	Resettable Zero-Knowledge	eprint	online
29	1999	Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK	crypto	467-484
30	1999	Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier	crypto	270-287
31	1998	The Graph Clustering Problem has a Perfect Zero-Knowledge Proof	eprint	online
32	1998	On the possibility of basing Cryptography on the assumption that $P \neq NP$	eprint	online
33	1998	The Random Oracle Methodology, Revisited	eprint	online
34	1998	Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK	eprint	online
35	1998	Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop	crypto	153-168
36	1997	A Probabilistic Error-Correcting Scheme	eprint	online
37	1997	Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop	eprint	online
38	1997	On the Foundations of Modern Cryptography	crypto	46-74
39	1997	Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem	crypto	105-111
40	1997	Public-Key Cryptosystems from Lattice Reduction Problems	crypto	112-131
41	1996	Collision-Free Hashing from Lattice Problems	eprint	online
42	1996	The Graph Clustering Problem has a Perfect Zero-Knowledge Proof	eprint	online
43	1996	Public-Key Cryptosystems from Lattice Reduction Problems	eprint	online
44	1996	How to Construct Constant-Round Zero-Knowledge Proof Systems for NP	jofc	167-190
45	1996	On-Line/Off-Line Digital Signatures	jofc	35-67
46	1995	Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs	crypto	325-338
47	1994	Definitions and Properties of Zero-Knowledge Proof Systems	jofc	1-32
48	1994	Incremental Cryptography: The Case of Hashing and Signing	crypto	216-233
49	1993	A Uniform-Complexity Treatment of Encryption and Zero-Knowledge	jofc	21-53
50	1993	A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm	jofc	97-116
51	1992	On Defining Proofs of Knowledge	crypto	390-420
52	1989	Sparse Pseudorandom Distributions	crypto	113-127
53	1989	On-Line/Off-Line Digital Schemes	crypto	263-275
54	1988	A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm	crypto	57-70
55	1988	On the Existence of Pseudorandom Generators	crypto	146-162
56	1988	Everything Provable is Provable in Zero-Knowledge	crypto	37-56
57	1987	How to Solve any Protocol Problem - An Efficiency Improvement	crypto	73-86
58	1986	Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme	crypto	104-110
59	1986	Towards a Theory of Software Protection	crypto	426-439
60	1986	How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design	crypto	171-185
61	1985	The Bit Security of Modular Squaring Given Partial Factorization of the Modulos	crypto	448-457
62	1985	On the Security of Ping-Pong Protocols when Implemented using the RSA	crypto	58-72
63	1984	On the Number of Close-and-Equal Pairs of Bits in a String	eurocrypt	127-141
64	1984	RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure	crypto	303-313
65	1984	On Concurrent Identification Protocols	eurocrypt	387-396
66	1984	On the Cryptographic Applications of Random Functions	crypto	276-288
67	1983	A Simple Protocol for Signing Contracts	crypto	133-136
68	1983	On the Power of Cascade Ciphers	crypto	43-50
69	1983	Electronic Wallet	crypto	383-386
70	1982	A Randomized Protocol for Signing Contracts	crypto	205-210
71	1982	On the Security of Multi-Party Ping-Pong Protocols	crypto	315

Oded Goldreich Search web for home page

Program Committees

Publications

Coauthors of Oded Goldreich