Moni Naor

International Association for Cryptologic Research

Moni Naor Search web for home page

Program Committees

1	2008	TCC	pc
2	2007	Eurocrypt	pc chair
3	2006	Crypto	pc
4	2005	Crypto	pc
5	2004	TCC	pc chair
6	2003	Eurocrypt	pc
7	2003	PKC	pc
8	2000	Eurocrypt	pc
9	2000	Asiacrypt	pc
10	1997	Crypto	pc
11	1995	Crypto	pc
12	1991	Crypto	pc

Publications

	year	title	booktitle	pages
1	2010	Public-Key Encryption in the Bounded-Retrieval Model	eurocrypt	113-134
2	2009	Public-Key Cryptosystems Resilient to Key Leakage	crypto	18-35
3	2009	Hedged Public-Key Encryption: How to Protect against Bad Randomness	asiacrypt	232-249
4	2009	How Efficient Can Memory Checking Be?	tcc	503-520
5	2009	An Optimally Fair Coin Toss	tcc	1-18
6	2008	Cryptography and Game Theory: Designing Protocols for Exchanging Information	tcc	320-339
7	2008	History-Independent Cuckoo Hashing	eprint	online
8	2007	Deterministic History-Independent Strategies for Storing Information on Write-Once Memories	eprint	online
9	2006	Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol	eurocrypt	online
10	2006	Our Data, Ourselves: Privacy Via Distributed Noise Generation	eurocrypt	online
11	2006	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models	crypto	online
12	2006	The Complexity of Online Memory Checking	eprint	online
13	2006	Receipt-Free Universally-Verifiable Voting with Everlasting Privacy	crypto	online
14	2006	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models	eprint	online
15	2006	Completeness in Two-Party Secure Computation: A Computational View	jofc	521-552
16	2005	Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs	tcc	online
17	2005	On Robust Combiners for Oblivious Transfer and Other Primitives	eurocrypt	online
18	2005	Computationally Secure Oblivious Transfer	jofc	1-35
19	2005	Pebbling and Proofs of Work	crypto	online
20	2004	Immunizing Encryption Schemes from Decryption Errors	eurocrypt	online
21	2003	On Cryptographic Assumptions and Challenges	crypto	online
22	2003	On Memory-Bound Functions for Fighting Spam	crypto	online
23	2002	Deniable Ring Authentication	crypto	online
24	2002	On Chosen Ciphertext Security of Multiple Encryptions	eprint	online
25	2002	Constructing Pseudo-Random Permutations with a Prescribed Structure	jofc	97-102
26	2001	Revocation and Tracing Schemes for Stateless Receivers	crypto	41-62
27	2001	Anti-persistence: History Independent Data Structures	eprint	online
28	2001	Revocation and Tracing Schemes for Stateless Receivers	eprint	online
29	2001	Pseudo-Random Functions and Factoring	eprint	online
30	2001	Communication Complexity and Secure Function Evaluation	eprint	online
31	2000	Timed Commitments	crypto	236-254
32	2000	Distributed Oblivious Transfer	asiacrypt	205-219
33	2000	Constructing Pseudo-Random Permutations with a Prescribed Structure	eprint	online
34	1999	Distributed Pseudo-random Functions and KDCs	eurocrypt	327-346
35	1999	Oblivious Transfer with Adaptive Queries	crypto	573-590
36	1999	Concurrent Zero-Knowledge	eprint	online
37	1999	On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited	jofc	29-66
38	1998	A Formal Treatment of Remotely Keyed Encryption	eurocrypt	251-265
39	1998	Secure and Efficient Metering	eurocrypt	576-590
40	1998	Private Information Retrieval by Keywords	eprint	online
41	1998	Threshold Traitor Tracing	crypto	502-517
42	1998	From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract)	crypto	267-282
43	1998	Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation	jofc	87-108
44	1998	An Efficient Existentially Unforgeable Signature Scheme and Its Applications	jofc	187-208
45	1997	Deniable Encryption	crypto	90-104
46	1997	Visual Authentication and Identification	eprint	online
47	1997	Visual Authentication and Identification	crypto	322-336
48	1996	Deniable Encryption	eprint	online
49	1996	Visual Cryptography II: Improving the Contrast Via the Cover Base	eprint	online
50	1996	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited	eprint	online
51	1996	Efficient Cryptographic Schemes Provably as Secure as Subset Sum	jofc	199-216
52	1994	Visual Cryptography	eurocrypt	1-12
53	1994	Tracing Traitors	crypto	257-270
54	1994	An Efficient Existentially Unforgeable Signature Scheme and its Applications	crypto	234-246
55	1993	Broadcast Encryption	crypto	480-491
56	1993	Codes for Interactive Authentication	crypto	355-367
57	1992	Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)	crypto	196-214
58	1992	Low Communication 2-Prover Zero-Knowledge Proofs for NP	crypto	215-227
59	1992	Pricing via Processing or Combatting Junk Mail	crypto	139-147
60	1991	Bit Commitment Using Pseudorandomness	jofc	151-158
61	1989	Bit Commitment Using Pseudo-Randomness	crypto	128-136
62	1988	Untraceable Electronic Cash	crypto	319-327

Moni Naor Search web for home page

Program Committees

Publications

Coauthors of Moni Naor