Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Naor, Moni"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast interactive coding against adversarial noise
Zvika Brakerski
,
Yael Tauman Kalai
,
Moni Naor
Journal of the ACM
61
(6), 2014, pp. 35: 1-30
Sliding bloom filters
Moni Naor
,
Eylon Yogev
Lecture Notes in Computer Science
8283
, 2013, pp. 513-523
Public-key cryptosystems resilient to key leakage
Moni Naor
,
Gil Segev
SIAM Journal on Computing
41
(4), 2012, pp. 772-814
Sketching in adversarial environments
Ilya Mironov
,
Moni Naor
,
Gil Segev
SIAM Journal on Computing
40
(6), 2011, pp. 1845-1870
Differential privacy under continual observation
Cynthia Dwork
,
Moni Naor
,
Toniann Pitassi
,
Guy N. Rothblum
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 715-724
On the compressibility of
\mathcal{NP}
instances and cryptographic applications
Danny Harnik
,
Moni Naor
SIAM Journal on Computing
39
(5), 2010, pp. 1667-1713
Basing cryptographic protocols on tamper-evident seals
Tal Moran
,
Moni Naor
Theoretical Computer Science
411
(10), 2010, pp. 1283-1310
De-amortized cuckoo hashing: Provable worst-case performance and experimental results
Yuriy Arbitman
,
Moni Naor
,
Gil Segev
Lecture Notes in Computer Science
5555
, 2009, pp. 107-118
On the complexity of differentially private data release: Efficient algorithms and hardness results
Cynthia Dwork
,
Moni Naor
,
Omer Reingold
,
Guy N. Rothblum
,
Salil Vadhan
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 381-390
Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku Puzzles
Ronen Gradwohl
,
Moni Naor
,
Benny Pinkas
,
Guy N. Rothblum
Theory of Computing Systems
44
(2), 2009, pp. 245-268
Derandomized constructions of
k
-wise (almost) independent permutations
Eyal Kaplan
,
Moni Naor
,
Omer Reingold
Algorithmica
55
(1), 2009, pp. 113-133
The complexity of online memory checking
Moni Naor
,
Guy N. Rothblum
Journal of the ACM
56
(1), 2009, pp. 2: 1-46
Games for exchanging information
Gillat Kol
,
Moni Naor
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 423-432
Sketching in adversarial environments
Ilya Mironov
,
Moni Naor
,
Gil Segev
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 651-660
History-independent cuckoo hashing
Moni Naor
,
Gil Segev
,
Udi Wieder
Lecture Notes in Computer Science
5126
, 2008, pp. 631-642
Zaps and their applications
Cynthia Dwork
,
Moni Naor
SIAM Journal on Computing
36
(6), 2007, pp. 1513-1543
Deterministic history-independent strategies for storing information on write-once memories
Tal Moran
,
Moni Naor
,
Gil Segev
Lecture Notes in Computer Science
4596
, 2007, pp. 303-315
On everlasting security in the hybrid bounded storage model
Danny Harnik
,
Moni Naor
Lecture Notes in Computer Science
4052
, 2006, pp. 192-203
Oblivious polynomial evaluation
Moni Naor
,
Benny Pinkas
SIAM Journal on Computing
35
(5), 2006, pp. 1254-1281
Basing cryptographic protocols on tamper-evident seals
Tal Moran
,
Moni Naor
Lecture Notes in Computer Science
3580
, 2005, pp. 285-297
On fairness in the carpool problem
Moni Naor
Journal of Algorithms
55
(1), 2005, pp. 93-98
Concurrent zero-knowledge
Cynthia Dwork
,
Moni Naor
,
Amit Sahai
Journal of the ACM
51
(6), 2004, pp. 851-898
Completeness in two-party secure computation - A computational view
Danny Harnik
,
Moni Naor
,
Omer Reingold
,
Alon Rosen
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 252-261
Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks
Gurmeet Singh Manku
,
Moni Naor
,
Udi Wieder
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 54-63
Number-theoretic constructions of efficient pseudo-random functions
Moni Naor
,
Omer Reingold
Journal of the ACM
51
(2), 2004, pp. 231-262
Seiten 1
2
3
4
>