- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- On the Difficulties of Disclosure Prevention in Statistical Databases The Case for Differential Privacy
- Differential Privacy Under Continual Observation Cynthia Dwork
- Games for Extracting Randomness Ran Halprin and Moni Naor
- Derandomized Constructions of k-Wise (Almost) Independent Permutations
- Games For Exchanging Information We consider the rational versions of two of the classical problems in foundations of cryptogra-
- Sketching in Adversarial Environments Ilya Mironov
- Basing Cryptographic Protocols on Tamper-Evident Seals In this paper we attempt to formally study two very intuitive physical models: sealed envelopes and
- Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
- Veri cation of a human in the loop Identi cation via the Turing Test
- On Fairness in the Carpool Problem May 4, 2004
- Perfect Zero-Knowledge Arguments for NP Using any One-Way Permutation
- Oblivious Polynomial Evaluation Benny Pinkas
- A Simple Fault Tolerant Distributed Hash Table Udi Wieder
- Coin-flipping games immune against linear-sized coalitions Tel Aviv University
- One-Bit Algorithms Amotz Bar-Noy
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOI.. 36, NO. 2, MARC'tI 1990 381 The Hardness of Decoding Linear Codes
- Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds
- Revealing Information while Preserving Privacy Irit Dinur Kobbi Nissim
- Dynamics and Equilibrium Sergiu Hart
- Moderately Hard Functions: From Complexity to Spam Weizmann Institute of Science
- On the Complexity of Differentially Private Data Release Efficient Algorithms and Hardness Results
- On Robust Combiners for Oblivious Transfer and other Primitives Danny Harnik # Joe Kilian + Moni Naor # Omer Reingold # Alon Rosen #
- Implicit Representation of Graphs \Lambda Sampath Kannan
- A lower bound on probabilistic algorithms for distributive ring IBM Research Division
- On the Compressibility of NP Instances and Cryptographic Applications #
- Fairness in Scheduling Miklos Ajtai \Lambda James Aspnes y Moni Naor z Yuval Rabani x
- Deniable Ring Authentication # Weizmann Institute of Science
- Concurrent ZeroKnowledge # Cynthia Dwork # Moni Naor + Amit Sahai #
- Learning to Impersonate Guy N. Rothblum
- Oblivious Polynomial Evaluation \Lambda Moni Naor y Benny Pinkas z
- Succinct Representation of General Unlabeled Graphs Moni Naor \Lambda
- A PseudoRandom Encryption Mode Moni Naor \Lambda Omer Reingold y
- Number-Theoretic Constructions of Ecient Pseudo-Random Functions
- Revocation and Tracing Schemes for Stateless Receivers Dalit Naor Moni Naor Jeff Lotspiech
- How Efficient can Memory Checking be? Cynthia Dwork
- Non-Malleability: An Introduction and Survey of Recent Developments
- A Minimal Model for Secure Computation We consider a minimal scenario for secure computation: Parties A and B have private inputs
- Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
- Perfect ZeroKnowledge Arguments for NP Using any OneWay Permutation #
- Zaps and Their Applications Cynthia Dwork
- Protecting Cryptographic Keys: The Trace and Revoke Approach Dalit Naor Moni Naor y
- On the Di#culties of Disclosure Prevention in Statistical Databases The Case for Di#erential Privacy
- Splitters and nearoptimal derandomization (Preliminary Version)
- Secure and Efficient Metering Moni Naor ? and Benny Pinkas ??
- Pricing via Processing Combatting Junk Mail \Lambda
- Know thy Neighbor's Neighbor: Better Routing for SkipGraphs and Small Worlds # .
- Visual Cryptography II: Improving the Contrast Via the Cover Base \Lambda
- Digital Signets: SelfEnforcing Protection of Digital Information (Preliminary Version)
- Magic Functions # In Memoriam
- Immunizing Encryption Schemes from Decryption Errors Cynthia Dwork1, Moni Naor2 , and Omer Reingold2
- Deterministic HistoryIndependent Strategies for Storing Information on WriteOnce Memories #
- Zaps and Their Applications Cynthia Dwork # Moni Naor +
- An Efficient Existentially Unforgeable Signature Scheme and its Applications \Lambda
- On the Construction of PseudoRandom Permutations: LubyRackoff Revisited
- Fault tolerant graphs, perfect hash functions and disjoint paths M. Ajtai \Lambda N. Alon y J. Bruck \Lambda R. Cypher \Lambda C.T. Ho \Lambda M. Naor \Lambda
- Distributed PseudoRandom Functions and Moni Naor ? Benny Pinkas ?? Omer Reingold ???
- Coinflipping games immune against linearsized coalitions Noga Alon #
- Implicit O(1) Probe Search \Lambda Department of Computer Science
- Learning to Impersonate Moni Naor # Guy N. Rothblum +
- Search Problems in the Decision Tree Model L'aszl'o Lov'asz \Lambda
- Moderately Hard Functions: From Complexity to Spam Moni Naor 1#
- Smallbias probability spaces: efficient constructions and applications \Lambda
- Bit Commitment Using PseudoRandomness \Lambda IBM Almaden Research Center
- Ecient Oblivious Transfer Protocols Moni Naor Benny Pinkas y
- Privacy Preserving Auctions and Mechanism Design \Lambda Moni Naor Benny Pinkas Reuben Sumner
- On the Complexity of Statistical Reasoning \Lambda Joe Kilian y Moni Naor z
- Local Computations on Static and Dynamic Graphs \Lambda Alain Mayer y Moni Naor z Larry Stockmeyer x
- Certificate Revocation and Certificate Update Moni Naor \Lambda Kobbi Nissim
- Scalable and Dynamic Quorum Systems Udi Wieder
- Matching nuts and bolts (Extended Abstract)
- An Implementation of Efficient PseudoRandom Functions Michael Langberg
- Span Programs and General Secure MultiParty Computation Ronald Cramer (ETH Zurich \Lambda )
- Evaluation may be easier than generation (Extended Abstract)
- On the Compressibility of NP Instances and Cryptographic Applications
- On sample Disclosure Risk: definitions, models and estimation
- A Formal Treatment of Remotely Keyed Encryption ?
- Ecient Trace and Revoke Schemes Moni Naor Benny Pinkas y
- Adaptively Secure Multiparty Computation Ran Canetti \Lambda Uri Feige y Oded Goldreich y Moni Naor y
- Pebbling and Proofs of Work Cynthia Dwork 1 , Moni Naor 2# , and Hoeteck Wee 3##
- Universal OneWay Hash Functions and their Cryptographic Applications \Lambda
- Security and Composition of Multiparty Cryptographic Protocols Ran Canetti \Lambda
- Access Control and Signatures via Quorum Secret Sharing \Lambda
- Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
- When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor
- The Minimum Reservation Rate Problem in Digital Audio/Video Systems \Lambda
- Derandomized Constructions of kWise (Almost) Independent Permutations #
- Rigorous Time/Space Tradeoffs for Inverting Functions \Lambda Amos Fiat y Moni Naor z
- Completeness in Two-Party Secure Computation -A Computational View
- An Optimally Fair Coin Toss We address one of the foundational problems in cryptography: the bias of coin-flipping pro-
- RECEIPT-FREE UNIVERSALLY-VERIFIABLE VOTING WITH EVERLASTING PRIVACY
- Information and Computation 167, 2745 (2001) doi:10.1006/inco.2000.3012, available online at http://www.idealibrary.com on
- The Complexity of Online Memory Checking Guy N. Rothblum
- Split-Ballot Voting: Everlasting Privacy With Distributed Trust
- THE LOAD, CAPACITY AND AVAILABILITY OF QUORUM SYSTEMS \Lambda
- From Unpredictability to Indistinguishability: A Simple Construction of PseudoRandom Functions from MACs
- NonMalleability: An Introduction and Survey of Recent Developments
- Verification of a human in the loop Identification via the Turing Test \Lambda
- Viceroy: A Scalable and Dynamic Emulation of the Dahlia Malkhi #
- Basing Cryptographic Protocols on TamperEvident Seals #
- Immunizing Encryption Schemes from Decryption Errors Cynthia Dwork 1 , Moni Naor 2? , and Omer Reingold 2??
- Constructing Ramsey graphs from small probability spaces IBM Almaden Research Center
- History-Independent Cuckoo Hashing Udi Wieder
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Comparing Information Without Leaking It Ronald Fagin
- Novel Architectures for P2P Applications: the ContinuousDiscrete Approach #+
- Our Data, Ourselves: Biased Coins and Privacy Cynthia Dwork
- WHAT CAN BE COMPUTED LOCALLY? \Lambda MONI NAOR y AND LARRY STOCKMEYER z
- Deniable Encryption ? Ran Canetti 1 Cynthia Dwork 2 Moni Naor 3 Rafail Ostrovsky 4
- On Fairness in the Carpool Problem Moni Naor #
- Tracing Traitors Benny Chor Amos Fiat y Moni Naor z Benny Pinkas x
- Efficient Cryptographic Schemes Provably as Secure as Subset Sum \Lambda
- A Simple Fault Tolerant Distributed Hash Table Moni Naor yz Udi Wieder z
- Distributed Oblivious Transfer Moni Naor ? Benny Pinkas ??
- Untraceable Electronic Cash y (Extended Abstract)
- Anti-persistence: History Independent Data Structures Moni Naor y Vanessa Teague z
- Weizmann Workshop on Multi Party Secure Computation
- Optimal Aggregation Algorithms for Middleware Ronald Fagin \Lambda
- The Complexity of Online Memory Checking # Moni Naor + Guy N. Rothblum #
- Computationally Secure Oblivious Transfer Moni Naor y Benny Pinkas z
- Scalable and Dynamic Quorum Systems # Moni Naor +# Udi Wieder #
- Synthesizers and Their Application to the Parallel Construction of PseudoRandom Functions \Lambda
- Visual Authentication and Identification Moni Naor \Lambda Benny Pinkas y
- Checking the Correctness of Memories \Lambda Manuel Blum y Will Evans y Peter Gemmell y Sampath Kannan z
- Publickey Cryptosystems Provably Secure against Chosen Ciphertext Attacks \Lambda
- Viceroy: A Scalable and Dynamic Emulation of the Dahlia Malkhi
- Weizmann Workshop on Multi Party Secure Computation
- Broadcast Encryption Amos Fiat y Moni Naor z
- Construction of Asymptotically Good LowRate ErrorCorrecting Codes through
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash
- Visual Cryptography \Lambda Moni Naor y Adi Shamir z
- Optimal File Sharing in Distributed Networks \Lambda
- PseudoRandom Functions and Factoring \Lambda Moni Naor y
- 31 Subjectivity and Correlation in Randomized Strategies 1 Introduction
- Computer science is an exciting and growing field,spanning a broad selection of topics. A Computer Science Research day will be held at the
- Novel Architectures for P2P Applications: the Continuous-Discrete The Weizmann Institute of Science
- A Minimal Model for Secure Computation \Lambda Uri Feige y Joe Kilian z Moni Naor x
- On MemoryBound Functions for Fighting Spam Cynthia Dwork \Lambda Andrew Goldberg y Moni Naor z
- Visual Authentication and Identification \Lambda Moni Naor y Benny Pinkas z
- Cryptographic and Physical ZeroKnowledge Proof Systems for Solutions of Sudoku Puzzles
- Applied Kid Cryptography How To Convince Your Children You Are Not Cheating
- Secure MultiParty Computation (Working Draft)
- Revocation and Tracing Schemes for Stateless Receivers # Dalit Naor + Moni Naor # Jeff Lotspiech
- Non-Malleable Cryptography Danny Dolev y Cynthia Dwork z Moni Naor x
- Threshold Traitor Tracing Moni Naor ? and Benny Pinkas ??
- Public-Key Cryptosystems Resilient to Key Leakage Most of the work in the analysis of cryptographic schemes is concentrated in abstract ad-
- Deniable Ring Authentication Weizmann Institute of Science
- Pan-Private Streaming Algorithms Cynthia Dwork
- Pebbling and Proofs of Work Cynthia Dwork1
