BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Iceland
1 × Poland
1 × Portugal
1 × Spain
16 × USA
2 × Canada
2 × Greece
2 × Italy
Collaborated with:
C.Dwork A.Fiat G.Segev O.Reingold M.Yung G.N.Rothblum T.Moran J.Naor D.Harnik U.Wieder A.Rosen U.Feige A.A.Schäffer G.Kol K.Nissim V.Teague B.Pinkas L.J.Stockmeyer S.Rudich J.P.Schmidt A.Siegel Y.Arbitman I.Mironov G.S.Manku R.Fagin A.Lotem A.Sahai J.B.Lotspiech J.Kilian D.Dolev S.Kannan T.Pitassi R.Canetti O.Goldreich S.P.Vadhan D.Feldman R.Impagliazzo N.Nisan A.Shamir
Talks about:
comput (6) secur (6) function (4) random (4) hash (4) algorithm (3) independ (3) histori (3) inform (3) model (3)

Person: Moni Naor

DBLP DBLP: Naor:Moni

Contributed to:

STOC 20102010
ICALP (1) 20092009
STOC 20092009
ICALP (2) 20082008
STOC 20082008
ICALP 20072007
ICALP (2) 20062006
ICML 20062006
ICALP 20052005
STOC 20042004
PODS 20012001
STOC 20012001
STOC 20002000
STOC 19991999
STOC 19981998
STOC 19971997
STOC 19961996
STOC 19941994
STOC 19931993
ICALP 19911991
STOC 19911991
STOC 19901990
ICALP 19891989
STOC 19891989
STOC 19881988
STOC 19871987

Wrote 36 papers:

STOC-2010-DworkNPR #difference #privacy
Differential privacy under continual observation (CD, MN, TP, GNR), pp. 715–724.
ICALP-v1-2009-ArbitmanNS #performance #worst-case
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results (YA, MN, GS), pp. 107–118.
STOC-2009-DworkNRRV #algorithm #complexity #on the #performance
On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.
ICALP-C-2008-NaorSW #independence
History-Independent Cuckoo Hashing (MN, GS, UW), pp. 631–642.
STOC-2008-KolN #game studies
Games for exchanging information (GK, MN), pp. 423–432.
STOC-2008-MironovNS #sketching
Sketching in adversarial environments (IM, MN, GS), pp. 651–660.
ICALP-2007-MoranNS #independence #information management
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories (TM, MN, GS), pp. 303–315.
ICALP-v2-2006-HarnikN #bound #hybrid #on the #security
On Everlasting Security in the Hybrid Bounded Storage Model (DH, MN), pp. 192–203.
ICML-2006-NaorR #learning
Learning to impersonate (MN, GNR), pp. 649–656.
ICALP-2005-MoranN #encryption #protocol
Basing Cryptographic Protocols on Tamper-Evident Seals (TM, MN), pp. 285–297.
STOC-2004-HarnikNRR #perspective
Completeness in two-party secure computation: a computational view (DH, MN, OR, AR), pp. 252–261.
STOC-2004-MankuNW #lookahead #network #power of #random
Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks (GSM, MN, UW), pp. 54–63.
PODS-2001-FaginLN #algorithm #middleware
Optimal Aggregation Algorithms for Middleware (RF, AL, MN).
STOC-2001-NaorN #communication #evaluation #protocol
Communication preserving protocols for secure function evaluation (MN, KN), pp. 590–599.
STOC-2001-NaorT #data type #independence #named
Anti-presistence: history independent data structures (MN, VT), pp. 492–501.
STOC-2000-NaorRR #pseudo
Pseudo-random functions and factoring (MN, OR, AR), pp. 11–20.
STOC-1999-NaorP #evaluation #polynomial
Oblivious Transfer and Polynomial Evaluation (MN, BP), pp. 245–254.
STOC-1998-DworkNS #concurrent
Concurrent Zero-Knowledge (CD, MN, AS), pp. 409–418.
STOC-1997-NaorR #on the #permutation #pseudo #revisited
On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (MN, OR), pp. 189–199.
STOC-1996-CanettiFGN #adaptation #multi
Adaptively Secure Multi-Party Computation (RC, UF, OG, MN), pp. 639–648.
STOC-1996-DworkLN #self
Digital Signets: Self-Enforcing Protection of Digital Information (CD, JBL, MN), pp. 489–498.
STOC-1996-Naor #evaluation #generative
Evaluation May Be Easier Than Generation (MN), pp. 74–83.
A minimal model for secure computation (UF, JK, MN), pp. 554–563.
STOC-1993-NaorS #question #what
What can be computed locally? (MN, LJS), pp. 184–193.
ICALP-1991-Naor #preprocessor #string
String Matching with Preprocessing of Text and Pattern (MN), pp. 739–750.
STOC-1991-DolevDN #encryption
Non-Malleable Cryptography (DD, CD, MN), pp. 542–552.
STOC-1991-FiatN #trade-off
Rigorous Time/Space Tradeoffs for Inverting Functions (AF, MN), pp. 534–541.
STOC-1990-NaorN #performance #probability
Small-bias Probability Spaces: Efficient Constructions and Applications (JN, MN), pp. 213–223.
Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (MN, MY), pp. 427–437.
ICALP-1989-FeldmanINNRS #generative #modelling #on the #random
On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.
Implicit O(1) Probe Search (AF, MN), pp. 336–344.
STOC-1989-NaorY #encryption
Universal One-Way Hash Functions and their Cryptographic Applications (MN, MY), pp. 33–43.
Non-Oblivious Hashing (AF, MN, JPS, AS), pp. 367–376.
STOC-1988-FiatNSSS #multi
Storing and Searching a Multikey Table (AF, MN, AAS, JPS, AS), pp. 344–353.
STOC-1988-KannanNR #graph #representation
Implicit Representation of Graphs (SK, MN, SR), pp. 334–343.
STOC-1987-NaorNS #algorithm #graph #parallel #performance
Fast Parallel Algorithms for Chordal Graphs (JN, MN, AAS), pp. 355–364.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.