default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoni Naor
Person information
- affiliation: Weizmann Institute of Science, Israel
- award (2016): ACM Paris Kanellakis Theory and Practice Award
- award (2014): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c172]Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik:
Are Your Keys Protected? Time Will Tell. ITC 2024: 3:1-3:28- [c171]Bar Alon
, Moni Naor, Eran Omri, Uri Stemmer:
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CRYPTO (8) 2024: 74-108 - [c170]Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen:
That's Not My Signature! Fail-Stop Signatures for a Post-quantum World. CRYPTO (1) 2024: 107-140 - [c169]Amir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon:
From Donkeys to Kings in Tournaments. ESA 2024: 3:1-3:14 - [c168]Moni Naor, Eugene Pekel:
Adjacency Sketches in Adversarial Environments. SODA 2024: 1067-1098 - [i88]Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik:
Are Your Keys Protected? Time will Tell. IACR Cryptol. ePrint Arch. 2024: 906 (2024) - 2023
- [j80]Roey Magen, Moni Naor:
Mirror games against an open book player. Theor. Comput. Sci. 976: 114159 (2023) - [c167]Bar Karov, Moni Naor:
New Algorithms and Applications for Risk-Limiting Audits. FORC 2023: 2:1-2:27 - [c166]Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik:
Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes. FORC 2023: 11:1-11:23 - [c165]Moni Naor, Kobbi Nissim, Uri Stemmer, Chao Yan:
Private Everlasting Prediction. NeurIPS 2023 - [i87]Bar Karov, Moni Naor:
New Algorithms and Applications for Risk-Limiting Audits. CoRR abs/2305.04050 (2023) - [i86]Moni Naor, Kobbi Nissim, Uri Stemmer, Chao Yan:
Private Everlasting Prediction. CoRR abs/2305.09579 (2023) - [i85]Moni Naor, Eugene Pekel:
Adjacency Sketches in Adversarial Environments. CoRR abs/2309.03728 (2023) - [i84]Omri Ben-Eliezer, Tomer Grossman, Moni Naor:
Does Prior Knowledge Help Detect Collisions? CoRR abs/2312.10196 (2023) - [i83]Omri Ben-Eliezer, Tomer Grossman, Moni Naor:
Does Prior Knowledge Help Detect Collisions? Electron. Colloquium Comput. Complex. TR23 (2023) - [i82]Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen:
That's not my signature! Fail-stop signatures for a post-quantum world. IACR Cryptol. ePrint Arch. 2023: 1754 (2023) - 2022
- [j79]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51(6): 1769-1795 (2022) - [c164]Shahar P. Cohen, Moni Naor:
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. CRYPTO (3) 2022: 252-281 - [c163]Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen:
CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs. CRYPTO (2) 2022: 668-698 - [c162]Roey Magen, Moni Naor:
Mirror Games Against an Open Book Player. FUN 2022: 20:1-20:12 - [c161]Boaz Menuhin, Moni Naor:
Keep That Card in Mind: Card Guessing with Limited Memory. ITCS 2022: 107:1-107:28 - [c160]Moni Naor, Noa Oved:
Bet-or-Pass: Adversarially Robust Bloom Filters. TCC (2) 2022: 777-808 - [i81]Roey Magen, Moni Naor:
Mirror Games Against an Open Book Player. CoRR abs/2204.12129 (2022) - [i80]Bar Alon, Moni Naor, Eran Omri, Uri Stemmer:
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CoRR abs/2207.05047 (2022) - [i79]Shahar P. Cohen, Moni Naor:
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. IACR Cryptol. ePrint Arch. 2022: 312 (2022) - [i78]Bar Alon, Moni Naor, Eran Omri, Uri Stemmer:
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. IACR Cryptol. ePrint Arch. 2022: 902 (2022) - [i77]Moni Naor, Noa Oved:
Bet-or-Pass: Adversarially Robust Bloom Filters. IACR Cryptol. ePrint Arch. 2022: 1292 (2022) - 2021
- [j78]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. 50(5): 1501-1536 (2021) - [c159]Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev:
Adversarial laws of large numbers and optimal regret in online classification. STOC 2021: 447-455 - [i76]Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev:
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. CoRR abs/2101.09054 (2021) - [i75]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. CoRR abs/2105.01409 (2021) - [i74]Boaz Menuhin, Moni Naor:
Keep That Card in Mind: Card Guessing with Limited Memory. CoRR abs/2107.03885 (2021) - [i73]Boaz Menuhin, Moni Naor:
Keep That Card in Mind: Card Guessing with Limited Memory. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j77]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. ACM Trans. Priv. Secur. 23(2): 9:1-9:32 (2020) - [c158]Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. COLT 2020: 2263-2285 - [c157]Moni Naor, Neil Vexler:
Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users. FORC 2020: 4:1-4:20 - [c156]Moni Naor, Lior Rotem, Gil Segev:
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC 2020: 9:1-9:25 - [c155]Tomer Grossman, Ilan Komargodski, Moni Naor:
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. ITCS 2020: 56:1-56:38 - [c154]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. SODA 2020: 1096-115 - [i72]Moni Naor, Neil Vexler:
Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users. CoRR abs/2004.03002 (2020) - [i71]Moni Naor, Shahar Paz, Eyal Ronen:
CRISP: Compromise Resilient Identity-based Symmetric PAKE. IACR Cryptol. ePrint Arch. 2020: 529 (2020)
2010 – 2019
- 2019
- [j76]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66(5): 34:1-34:28 (2019) - [j75]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. 32(2): 361-392 (2019) - [j74]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. ACM Trans. Algorithms 15(3): 35:1-35:30 (2019) - [c153]Moni Naor, Benny Pinkas, Eyal Ronen:
How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior. CCS 2019: 1369-1386 - [c152]Moni Naor, Omer Paneth, Guy N. Rothblum:
Incrementally Verifiable Computation via Incremental PCPs. TCC (2) 2019: 552-576 - [i70]Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. CoRR abs/1911.10137 (2019) - [i69]Tomer Grossman, Ilan Komargodski, Moni Naor:
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Electron. Colloquium Comput. Complex. TR19 (2019) - [i68]Moni Naor, Omer Paneth, Guy N. Rothblum:
Incrementally Verifiable Computation via Incremental PCPs. IACR Cryptol. ePrint Arch. 2019: 1407 (2019) - [i67]Moni Naor, Lior Rotem, Gil Segev:
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. IACR Cryptol. ePrint Arch. 2019: 1458 (2019) - 2018
- [j73]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory 64(6): 4179-4190 (2018) - [c151]Ilan Komargodski, Moni Naor, Eylon Yogev:
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) 2018: 162-194 - [c150]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. TCC (2) 2018: 575-599 - [i66]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. CoRR abs/1812.10917 (2018) - [i65]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i64]Moni Naor, Benny Pinkas, Eyal Ronen:
How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior. IACR Cryptol. ePrint Arch. 2018: 3 (2018) - [i63]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. IACR Cryptol. ePrint Arch. 2018: 823 (2018) - 2017
- [j72]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP. J. Cryptol. 30(2): 444-469 (2017) - [c149]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. FOCS 2017: 622-632 - [c148]Pavel Hubácek, Moni Naor, Eylon Yogev:
The Journey from NP to TFNP Hardness. ITCS 2017: 60:1-60:21 - [i62]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. Electron. Colloquium Comput. Complex. TR17 (2017) - [i61]Dimitrios Papadopoulos, Duane Wessels, Shumon Huque, Moni Naor, Jan Vcelák, Leonid Reyzin, Sharon Goldberg:
Can NSEC5 be practical for DNSSEC deployments? IACR Cryptol. ePrint Arch. 2017: 99 (2017) - [i60]Ilan Komargodski, Moni Naor, Eylon Yogev:
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. IACR Cryptol. ePrint Arch. 2017: 486 (2017) - 2016
- [j71]Tal Moran, Moni Naor, Gil Segev:
An Optimally Fair Coin Toss. J. Cryptol. 29(3): 491-513 (2016) - [j70]Pavel Hubácek, Moni Naor, Jonathan R. Ullman:
When Can Limited Randomness Be Used in Repeated Games? Theory Comput. Syst. 59(4): 722-746 (2016) - [c147]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. CRYPTO (3) 2016: 123-145 - [c146]Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev:
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. CRYPTO (2) 2016: 491-520 - [c145]Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? ITCS 2016: 357-368 - [c144]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA 2016: 367-375 - [c143]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC 2016: 1101-1114 - [c142]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. TCC (B2) 2016: 485-514 - [i59]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. Electron. Colloquium Comput. Complex. TR16 (2016) - [i58]Pavel Hubácek, Moni Naor, Eylon Yogev:
The Journey from NP to TFNP Hardness. Electron. Colloquium Comput. Complex. TR16 (2016) - [i57]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. Electron. Colloquium Comput. Complex. TR16 (2016) - [i56]Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin:
NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses. IACR Cryptol. ePrint Arch. 2016: 83 (2016) - [i55]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. IACR Cryptol. ePrint Arch. 2016: 194 (2016) - [i54]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. 2016: 251 (2016) - [i53]Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev:
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. IACR Cryptol. ePrint Arch. 2016: 281 (2016) - [i52]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. IACR Cryptol. ePrint Arch. 2016: 291 (2016) - 2015
- [j69]Moni Naor, Eylon Yogev:
Tight Bounds for Sliding Bloom Filters. Algorithmica 73(4): 652-672 (2015) - [c141]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum:
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) 2015: 735-751 - [c140]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. CRYPTO (2) 2015: 565-584 - [c139]Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv:
NSEC5: Provably Preventing DNSSEC Zone Enumeration. NDSS 2015 - [c138]Pavel Hubácek, Moni Naor, Jonathan R. Ullman:
When Can Limited Randomness Be Used in Repeated Games? SAGT 2015: 259-271 - [c137]Ben A. Fisch, Daniel Freund, Moni Naor:
Secure Physical Computation Using Disposable Circuits. TCC (1) 2015: 182-198 - [c136]Moni Naor, Asaf Ziv:
Primary-Secondary-Resolver Membership Proof Systems. TCC (2) 2015: 199-228 - [i51]Pavel Hubácek, Moni Naor, Jonathan R. Ullman:
When Can Limited Randomness Be Used in Repeated Games? CoRR abs/1507.01191 (2015) - [i50]Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? Electron. Colloquium Comput. Complex. TR15 (2015) - [i49]Ben Fisch, Daniel Freund, Moni Naor:
Secure Physical Computation using Disposable Circuits. IACR Cryptol. ePrint Arch. 2015: 226 (2015) - [i48]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. IACR Cryptol. ePrint Arch. 2015: 543 (2015) - [i47]Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? IACR Cryptol. ePrint Arch. 2015: 863 (2015) - 2014
- [j68]Zvika Brakerski, Yael Tauman Kalai, Moni Naor:
Fast Interactive Coding against Adversarial Noise. J. ACM 61(6): 35:1-35:30 (2014) - [c135]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP. ASIACRYPT (2) 2014: 254-273 - [c134]Ben Fisch, Daniel Freund, Moni Naor:
Physical Zero-Knowledge Proofs of Physical Properties. CRYPTO (2) 2014: 313-336 - [c133]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)Perfect Obfuscation. FOCS 2014: 374-383 - [e3]Moni Naor:
Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014. ACM 2014, ISBN 978-1-4503-2698-8 [contents] - [i46]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP from Indistinguishability Obfuscation. CoRR abs/1403.5698 (2014) - [i45]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR abs/1408.2279 (2014) - [i44]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. CoRR abs/1412.8356 (2014) - [i43]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 213 (2014) - [i42]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014: 347 (2014) - [i41]Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv:
NSEC5: Provably Preventing DNSSEC Zone Enumeration. IACR Cryptol. ePrint Arch. 2014: 582 (2014) - [i40]Moni Naor, Asaf Ziv:
Primary-Secondary-Resolver Membership Proof Systems. IACR Cryptol. ePrint Arch. 2014: 905 (2014) - 2013
- [c132]Moni Naor, Eylon Yogev:
Sliding Bloom Filters. ISAAC 2013: 513-523 - [c131]Zvika Brakerski, Moni Naor:
Fast Algorithms for Interactive Coding. SODA 2013: 443-456 - [c130]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. TCC 2013: 40-59 - [i39]Moni Naor, Eylon Yogev:
Sliding Bloom Filters. CoRR abs/1304.5872 (2013) - [i38]Zvika Brakerski, Moni Naor:
Fast Algorithms for Interactive Coding. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j67]Moni Naor, Gil Segev:
Public-Key Cryptosystems Resilient to Key Leakage. SIAM J. Comput. 41(4): 772-814 (2012) - [c129]Cynthia Dwork, Moni Naor, Salil P. Vadhan:
The Privacy of the Analyst and the Power of the State. FOCS 2012: 400-409 - [i37]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. Electron. Colloquium Comput. Complex. TR12 (2012) - [i36]Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek:
Hedged Public-key Encryption: How to Protect against Bad Randomness. IACR Cryptol. ePrint Arch. 2012: 220 (2012) - [i35]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2012: 722 (2012) - 2011
- [j66]Ilya Mironov, Moni Naor, Gil Segev:
Sketching in Adversarial Environments. SIAM J. Comput. 40(6): 1845-1870 (2011) - 2010
- [j65]Ran Halprin, Moni Naor:
Games for extracting randomness. XRDS 17(2): 44-48 (2010) - [j64]Moni Naor, Benny Pinkas:
Efficient trace and revoke schemes. Int. J. Inf. Sec. 9(6): 411-424 (2010) - [j63]Cynthia Dwork, Moni Naor:
On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy. J. Priv. Confidentiality 2(1) (2010) - [j62]Danny Harnik, Moni Naor:
On the Compressibility of NP Instances and Cryptographic Applications. SIAM J. Comput. 39(5): 1667-1713 (2010) - [j61]Tal Moran, Moni Naor:
Basing cryptographic protocols on tamper-evident seals. Theor. Comput. Sci. 411(10): 1283-1310 (2010) - [j60]Tal Moran, Moni Naor:
Split-ballot voting: Everlasting privacy with distributed trust. ACM Trans. Inf. Syst. Secur. 13(2): 16:1-16:43 (2010) - [c128]Moni Naor:
The privacy of tracing traitors. Digital Rights Management Workshop 2010: 1-2 - [c127]Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs:
Public-Key Encryption in the Bounded-Retrieval Model. EUROCRYPT 2010: 113-134 - [c126]Yuriy Arbitman, Moni Naor, Gil Segev:
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. FOCS 2010: 787-796 - [c125]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. ICS 2010: 66-80 - [c124]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum:
Differential privacy under continual observation. STOC 2010: 715-724
2000 – 2009
- 2009
- [j59]Eyal Kaplan, Moni Naor, Omer Reingold:
Derandomized Constructions of k-Wise (Almost) Independent Permutations. Algorithmica 55(1): 113-133 (2009) - [j58]Moni Naor, Guy N. Rothblum:
The complexity of online memory checking. J. ACM 56(1): 2:1-2:46 (2009) - [j57]