Moni Naor

Moni Naor's AcademicInfluence.com Rankings

Moni Naor

Computer Science

#2728

World Rank

#2856

Historical Rank

Theoretical Computer Science

#35

World Rank

#35

Historical Rank

computer-science Degrees

Moni Naor

Mathematics

#3840

World Rank

#5572

Historical Rank

Measure Theory

#264

World Rank

#413

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Moni Naor's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science Weizmann Institute of Science
Bachelors Mathematics and Computer Science Technion – Israel Institute of Technology

Similar Degrees You Can Earn

Why Is Moni Naor Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Moni Naor's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Visual Cryptography (1994) (2715)
Optimal aggregation algorithms for middleware (2001) (2075)
Rank aggregation methods for the Web (2001) (1930)
Our Data, Ourselves: Privacy Via Distributed Noise Generation (2006) (1734)
Pricing via Processing or Combatting Junk Mail (1992) (1371)
Untraceable Electronic Cash (1990) (1237)
Revocation and Tracing Schemes for Stateless Receivers (2001) (1236)
Public-key cryptosystems provably secure against chosen ciphertext attacks (1990) (1067)
Non-malleable cryptography (1991) (1029)
Universal one-way hash functions and their cryptographic applications (1989) (1015)
Multicast security: a taxonomy and some efficient constructions (1999) (797)
Efficient oblivious transfer protocols (2001) (795)
Privacy preserving auctions and mechanism design (1999) (788)
Small-bias probability spaces: efficient constructions and applications (1990) (786)
Viceroy: a scalable and dynamic emulation of the butterfly (2002) (775)
Tracing traitors (1994) (735)
Nonmalleable Cryptography (2000) (696)
Number-theoretic constructions of efficient pseudo-random functions (1997) (683)
Oblivious transfer and polynomial evaluation (1999) (652)
Bit commitment using pseudorandomness (2004) (625)
Differential privacy under continual observation (2010) (609)
Certificate revocation and certificate update (1998) (555)
Adaptively secure multi-party computation (1996) (530)
Public-Key Cryptosystems Resilient to Key Leakage (2009) (458)
Concurrent zero-knowledge (1998) (412)
On the complexity of differentially private data release: efficient algorithms and hardness results (2009) (403)
Deniable Encryption (1997) (366)
On Cryptographic Assumptions and Challenges (2003) (322)
Visual Authentication and Identification (1997) (321)
Checking the correctness of memories (1991) (317)
Splitters and near-optimal derandomization (1995) (311)
Efficient cryptographic schemes provably as secure as subset sum (1989) (289)
On Memory-Bound Functions for Fighting Spam (2003) (287)
Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs (1991) (271)
Zaps and their applications (2000) (269)
Novel architectures for P2P applications: the continuous-discrete approach (2003) (268)
Implicit representation of graphs (1992) (259)
Private Information Retrieval by Keywords (1998) (254)
Bit Commitment Using Pseudo-Randomness (1989) (252)
Timed Commitments (2000) (250)
Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings (2007) (246)
Visual cryptography for grey level images (2000) (239)
The load, capacity and availability of quorum systems (1994) (235)
Oblivious Transfer with Adaptive Queries (1999) (234)
Efficient trace and revoke schemes (2000) (233)
Comparing information without leaking it (1996) (227)
Non-Malleable Cryptography (Extended Abstract) (1991) (224)
The complexity of online memory checking (2005) (221)
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks (2004) (220)
A minimal model for secure computation (extended abstract) (1994) (217)
Distributed Pseudo-random Functions and KDCs (1999) (215)
Public-Key Encryption in the Bounded-Retrieval Model (2010) (210)
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy (2006) (198)
Computationally Secure Oblivious Transfer (2004) (198)
Visual Cryptography II: Improving the Contrast Via the Cover Base (1996) (195)
Cryptography and Game Theory: Designing Protocols for Exchanging Information (2008) (193)
Deniable Ring Authentication (2002) (180)
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation (1998) (170)
Magic functions (1999) (169)
Concurrent zero-knowledge (2004) (166)
Communication preserving protocols for secure function evaluation (2001) (163)
Synthesizers and their application to the parallel construction of pseudo-random functions (1995) (163)
What can be computed locally? (1993) (160)
Pan-Private Streaming Algorithms (2010) (158)
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited (1996) (151)
VERI CATION OF A HUMAN IN THE LOOP OR IDENTI CATION VIA THE TURING TEST (1996) (147)
A Simple Fault Tolerant Distributed Hash Table (2003) (141)
Oblivious Polynomial Evaluation (2006) (138)
Does parallel repetition lower the error in computationally sound protocols? (1997) (137)
On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy (2010) (136)
Hedged Public-Key Encryption: How to Protect against Bad Randomness (2009) (133)
Threshold Traitor Tracing (1998) (130)
Games for exchanging information (2008) (128)
The probabilistic method yields deterministic parallel algorithms (1989) (127)
Amortized communication complexity (1991) (120)
A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring (1991) (118)
The hardness of decoding linear codes with preprocessing (1990) (118)
On Robust Combiners for Oblivious Transfer and Other Primitives (2005) (118)
A Minimal Model for Secure Computation (2002) (117)
Traitor tracing with constant size ciphertext (2008) (114)
Access control and signatures via quorum secret sharing (1998) (112)
On the Compressibility of NP Instances and Cryptographic Applications (2006) (112)
An Efficient Existentially Unforgeable Signature Scheme and Its Applications (1994) (108)
Distributed Oblivious Transfer (2000) (107)
Digital signets: self-enforcing protection of digital information (preliminary version) (1996) (106)
Novel architectures for P2P applications: The continuous-discrete approach (2007) (102)
Pebbling and Proofs of Work (2005) (101)
Split-ballot voting: Everlasting privacy with distributed trust (2007) (97)
Derandomized Constructions of k-Wise (Almost) Independent Permutations (2005) (94)
Extreme Programming and Agile Processes in Software Engineering (2004) (94)
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (1994) (94)
Theory and Applications of Models of Computation (2015) (91)
An Optimally Fair Coin Toss (2009) (90)
Immunizing Encryption Schemes from Decryption Errors (2004) (86)
Anti-persistence: history independent data structures (2001) (86)
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract) (1997) (82)
Witnesses for Boolean matrix multiplication and for shortest paths (1992) (81)
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation (2009) (79)
Rank Aggregation Revisited (2002) (79)
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations (2016) (78)
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998 (2003) (77)
Secure and Efficient Metering (1998) (77)
Scalable and dynamic quorum systems (2003) (74)
Computer Vision – ECCV 2014 (2014) (72)
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds (2004) (71)
Succinct representation of general unlabeled graphs (1990) (69)
Fast parallel algorithms for chordal graphs (1987) (67)
Search problems in the decision tree model (1991) (67)
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results (2009) (66)
Is There an Oblivious RAM Lower Bound? (2016) (64)
Basing cryptographic protocols on tamper-evident seals (2005) (63)
Coin-flipping games immune against linear-sized coalitions (1990) (61)
Codes for Interactive Authentication (1994) (61)
Job Scheduling Strategies for Parallel Processing (2017) (60)
One-Way Functions and (Im)Perfect Obfuscation (2014) (59)
Local computations on static and dynamic graphs (1995) (59)
Energy-Efficient Data Centers (2014) (59)
Optimal file sharing in distributed networks (1991) (58)
Decision trees and downward closures (1988) (58)
Rigorous time/space tradeoffs for inverting functions (1991) (57)
Secret-Sharing for NP (2014) (54)
Bloom Filters in Adversarial Environments (2014) (54)
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract) (1992) (54)
How to Share a Secret, Infinitely (2016) (54)
From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract) (1998) (53)
A formal treatment of remotely keyed encryption (1998) (53)
How Efficient Can Memory Checking Be? (2009) (50)
Fairness in scheduling (1995) (50)
Computer Analysis of Images and Patterns (1989) (50)
Rigorous Time/Space Trade-offs for Inverting Functions (1999) (48)
Fast Algorithms for Interactive Coding (2013) (48)
Image Analysis and Recognition (2016) (48)
NSEC5: Provably Preventing DNSSEC Zone Enumeration (2014) (48)
Low Communication 2-Prover Zero-Knowledge Proofs for NP (1992) (47)
Pseudorandom Functions and Factoring (2002) (47)
On fairness in the carpool problem (2005) (45)
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol (2006) (45)
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2007) (44)
Implicit O(1) probe search (1989) (44)
Algorithms and Models for the Web Graph (2016) (44)
History-Independent Cuckoo Hashing (2008) (43)
Fast Software Encryption (2014) (42)
Fast Interactive Coding against Adversarial Noise (2014) (41)
The Power of Distributed Verifiers in Interactive Proofs (2018) (40)
Issues in Multicast Security: A Taxonomy and E cient Constructions (1999) (39)
Privately Learning Thresholds: Closing the Exponential Gap (2019) (39)
Sketching in adversarial environments (2008) (38)
Pure Differential Privacy for Rectangle Queries via Private Partitions (2015) (37)
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing (2017) (36)
Communication Complexity and Secure Function Evaluation (2001) (36)
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models (2006) (35)
Adversarial laws of large numbers and optimal regret in online classification (2021) (35)
Perfect zero-knowledge ar-guments for NP can be based on general complexity assumptions (1998) (35)
Formal Methods for Components and Objects (2003) (35)
Matching nuts and bolts (1994) (34)
Succinct Proofs for NP and Spooky Interactions (2004) (34)
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (2016) (34)
Fault tolerant graphs, perfect hash functions and disjoint paths (1992) (33)
Constructing Pseudo-Random Permutations with a Prescribed Structure (2001) (32)
Social Informatics (2016) (32)
Three results on interactive communication (1993) (31)
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions (2018) (31)
Physical Zero-Knowledge Proofs of Physical Properties (2014) (30)
The Privacy of the Analyst and the Power of the State (2012) (30)
Constructing Ramsey graphs from small probability spaces (1992) (30)
Static Analysis (2014) (29)
Adaptive Hypermedia and Adaptive Web-Based Systems (2004) (28)
Completeness in Two-Party Secure Computation: A Computational View (2004) (28)
Secure Accounting and Auditing on the Web (1998) (28)
On Everlasting Security in the Hybrid Bounded Storage Model (2006) (27)
Bit commitment using pseudo-randomness (extended abstract) (1989) (27)
Latent Variable Analysis and Signal Separation (2015) (27)
Games for extracting randomness (2010) (26)
The Journey from NP to TFNP Hardness (2016) (25)
Augmented Reality, Virtual Reality, and Computer Graphics (2016) (25)
Split-ballot voting: everlasting privacy with distributed trust (2010) (25)
Data Science (2015) (24)
Pseudo-random functions and factoring (extended abstract) (2000) (23)
String Matching with Preprocessing of Text and Pattern (1991) (23)
Quantum Interaction (2014) (22)
3D Research Challenges in Cultural Heritage (2014) (22)
Nonoblivious hashing (1992) (22)
Medical Simulation (2004) (21)
Non-oblivious hashing (1988) (20)
Protecting Cryptographic Keys: The Trace-and-Revoke Approach (2003) (20)
An Eecient Existentially Unforgeable Signature Scheme and Its Applications (1994) (20)
Computer Vision – ECCV 2016 (2016) (20)
Sliding Bloom Filters (2013) (19)
Computer Vision – ECCV 2016 Workshops (2016) (18)
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories (2007) (18)
How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior (2019) (17)
Evaluation may be easier than generation (extended abstract) (1996) (17)
Research and Advanced Technology for Digital Libraries (2004) (17)
On Dice and Coins: Models of Computation for Random Generation (1989) (17)
Applied Kid Cryptography or How To Convince Your Children You Are Not Cheating (1999) (16)
Tight Bounds for Sliding Bloom Filters (2013) (16)
Evaluation May Be Easier than Generation (1996) (15)
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs (2005) (15)
Multiple Classifier Systems (2013) (15)
Information Computing and Applications (2012) (15)
Computer Vision – ECCV 2016 (2016) (15)
NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses (2016) (15)
One-bit algorithms (1990) (14)
High Performance Computing Systems. Performance Modeling, Benchmarking, and Simulation (2014) (14)
Learning to impersonate (2006) (14)
Primary-Secondary-Resolver Membership Proof Systems (2015) (14)
Computer Vision – ECCV 2016 (2016) (14)
Data Mining and Big Data (2017) (13)
The Dynamic And-Or Quorum System (2005) (12)
Central European Functional Programming School (2013) (12)
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security (2016) (12)
On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (1992) (12)
Informational overhead of incentive compatibility (2008) (12)
Reversible Computation (2016) (11)
Games for extracting randomness (2009) (11)
Hardness-Preserving Reductions via Cuckoo Hashing (2013) (11)
Fault-Tolerant Storage in a Dynamic Environment (2004) (11)
Proceedings of the 5th conference on Innovations in theoretical computer science (2014) (10)
Image and Graphics (2015) (10)
Advances in Neural Networks - ISNN 2017 (2017) (10)
Foundations of Security Analysis and Design VIII (2015) (10)
An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time (1991) (10)
Advances in Software Engineering Techniques (2009) (9)
Computer Vision and Graphics (2012) (9)
Computational Science - ICCS 2004 (2004) (9)
Moderately Hard Functions: From Complexity to Spam Fighting (2003) (9)
Can NSEC5 be practical for DNSSEC deployments? (2017) (9)
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (2016) (9)
Advances in New Technologies, Interactive Interfaces and Communicability (2011) (9)
Computer Vision – ECCV 2016 Workshops (2016) (9)
Advances in Cryptology -- CRYPTO 2015 (2015) (8)
Symbiotic Interaction (2014) (8)
Computer Vision – ECCV 2016 (2016) (8)
Post-Quantum Cryptography (2017) (8)
Storing and searching a multikey table (1988) (7)
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets (2014) (7)
Haptic and Audio Interaction Design (2012) (7)
Transactions on Data Hiding and Multimedia Security VIII (2012) (7)
Implementing Huge Sparse Random Graphs (2007) (7)
Machine Learning in Medical Imaging (2017) (7)
On Chosen Ciphertext Security of Multiple Encryptions (2002) (7)
On the complexity of statistical reasoning (1995) (7)
Parallel Problem Solving from Nature - PPSN XII (2012) (7)
A Pseudo-Random Encryption Mode (2014) (6)
Advances in Cryptology – ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part III (2017) (6)
Secure Physical Computation Using Disposable Circuits (2015) (6)
Certiicate Revocation and Certiicate Update (1998) (6)
Image and Video Technology (2017) (6)
Neural Information Processing (2015) (6)
The Security of Lazy Users in Out-of-Band Authentication (2018) (6)
Formal Methods for Open Object-Based Distributed Systems (2006) (6)
The minimum reservation rate problem in digital audio/video systems (1993) (5)
Keep That Card in Mind: Card Guessing with Limited Memory (2021) (5)
Coalgebraic Methods in Computer Science (2016) (5)
Computer Vision Systems (2017) (5)
Privacy Technologies and Policy (2012) (5)
Advanced Information Systems Engineering (2013) (5)
Certi cate Revocation and Certi cate Update (2016) (5)
Business Process Management (2015) (5)
Wired/Wireless Internet Communications (2014) (5)
Computers Helping People with Special Needs (2016) (4)
Computer Vision -- ACCV 2014 (2014) (4)
Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users (2020) (4)
Serious Games Development and Applications (2013) (4)
User Modeling, Adaptation and Personalization (2015) (4)
Computer Science – Theory and Applications (2016) (4)
Internet Science (2017) (4)
Incrementally Verifiable Computation via Incremental PCPs (2019) (4)
A Formal Treatment of Remotely KeyedEncryption ( Extended Abstract ) ? (2007) (4)
Secret-Sharing for NP from Indistinguishability Obfuscation (2014) (4)
Product-Focused Software Process Improvement (2014) (4)
Computer Vision – ACCV 2014: 12th Asian Conference on Computer Vision, Singapore, Singapore, November 1-5, 2014, Revised Selected Papers, Part I (2015) (4)
Big Data Analytics and Knowledge Discovery (2017) (4)
Swarm Intelligence Based Optimization (2016) (4)
Decision trees and downward closures* (Extended Abstract) (1988) (4)
Advances in Cryptology – EUROCRYPT 2016 (2016) (4)
NASA Formal Methods (2016) (3)
Augmented Reality, Virtual Reality, and Computer Graphics (2017) (3)
Articulated Motion and Deformable Objects (2016) (3)
Local Computations on Static and Dynamic Graphs (Preliminary Version). (1995) (3)
Pattern Recognition (2014) (3)
Information Security and Cryptology (2014) (3)
Middleware 2009 (2009) (3)
Theory and Applications of Models of Computation (2017) (3)
Ad-hoc, Mobile, and Wireless Networks (2015) (3)
Euro-Par 2011: Parallel Processing Workshops (2011) (3)
Persuasive Technology (2014) (3)
Combinatorial Image Analysis (2015) (3)
Algorithm Engineering (2016) (3)
Cryptography and mechanism design (2001) (3)
Confidentiality-Preserving Query Execution of Fragmented Outsourced Data (2018) (3)
Trust, Privacy and Security in Digital Business (2016) (2)
Computer Vision - ACCV 2014 Workshops (2014) (2)
Ubiquitous Networking (2017) (2)
Cryptography and Information Security in the Balkans (2015) (2)
Camera-Based Document Analysis and Recognition (2011) (2)
Algorithmic Aspects of Cloud Computing (2017) (2)
Instance Complexity and Unlabeled Certificates in the Decision Tree Model (2019) (2)
Entertainment Computing – ICEC 2004 (2004) (2)
Computational Forensics (2015) (2)
Notes in Computer Science 8670 Commenced (2014) (2)
Software Engineering and Formal Methods (2015) (2)
Applications of Evolutionary Computation (2017) (2)
Theory of cryptography : first Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004 : proceedings (2004) (2)
Swarm, Evolutionary, and Memetic Computing (2014) (2)
Image and Graphics: 8th International Conference, ICIG 2015, Tianjin, China, August 13–16, 2015, Proceedings, Part III (2015) (2)
Number-theoretic Constructions of Eecient Pseudo-random Functions Preliminary Version (1997) (2)
Image and Signal Processing (2016) (2)
Information Security and Cryptology – ICISC 2017 (2017) (2)
Perspectives of System Informatics (2017) (2)
Theory and Practice of Natural Computing (2017) (2)
Formal Methods and Software Engineering (2017) (2)
Bit Commitment Using Pseudorandomness 1 (2006) (2)
When Can Limited Randomness Be Used in Repeated Games? (2015) (2)
When Can Limited Randomness Be Used in Repeated Games? (2016) (2)
Intelligence and Security Informatics (2004) (2)
Neural Information Processing (2015) (1)
Fast Parallel Algorithms for Chordal Graphs* (Extended Abstract) (1987) (1)
Advances in Swarm Intelligence (2016) (1)
Algorithms and Architectures for Parallel Processing (2017) (1)
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably (2022) (1)
Job Scheduling Strategies for Parallel Processing (2015) (1)
Connectomics in NeuroImaging (2017) (1)
Know thy Neighbor ’ s Neighbor : the Power of Lookahead in Small Worlds and Randomized P 2 P Networks ∗ † (2005) (1)
Social Informatics (2017) (1)
Applications of Evolutionary Computation (2014) (1)
Stretching NSEC 3 to the Limit : Efficient Zone Enumeration Attacks on NSEC 3 Variants (2015) (1)
Advances in Computer Systems Architecture (2004) (1)
Current Trends in Web Engineering (2017) (1)
Financial Cryptography and Data Security (2007) (1)
Computational Science - ICCS 2004 (2004) (1)
Parallel Processing and Applied Mathematics (2017) (1)
Logic, Language, Information, and Computation (2017) (1)
Non-Oblivious Hashing (Extended Abstract) (1988) (1)
Advances in Computational Intelligence (2015) (1)
Graphics Recognition. Current Trends and Challenges (2013) (1)
Combinatorial Algorithms (2014) (1)
Cooperative Design, Visualization, and Engineering (2014) (1)
Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings (2017) (1)
Secret-Sharing for NP (2016) (1)
Job Scheduling Strategies for Parallel Processing (2014) (1)
Storing and Searching a Multikey Table (Extended Abstract) (1988) (1)
Theoretical Aspects of Computing – ICTAC 2018 (2018) (1)
Privacy in Statistical Databases (2004) (1)
Security Standardisation Research (2016) (1)
Critical Information Infrastructures Security (2016) (1)
The privacy of tracing traitors (2010) (1)
Genetic Programming (2013) (1)
Combinatorial Optimization and Applications (2017) (1)
Computer Performance Engineering (2016) (1)
Neural Information Processing (2015) (1)
Ubiquitous Computing and Ambient Intelligence (2016) (1)
High Performance Computing (2015) (1)
An Optimally Fair Coin Toss (2015) (1)
Evolving Computability (2015) (1)
CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs (2022) (1)
Hardness-Preserving Reductions via Cuckoo Hashing (2018) (1)
Advances in Swarm Intelligence (2012) (1)
CHIP and CRISP: Compromise Resilient Identity-based Symmetric PAKEs (2020) (1)
Research in Attacks, Intrusions, and Defenses (2016) (1)
Computational Logistics (2017) (1)
Proceedings of the 26th annual international conference on Advances in Cryptology (2007) (1)
Transactions on Computational Collective Intelligence XX (2015) (1)
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols (2022) (1)
CRISP: Compromise Resilient Identity-based Symmetric PAKE (2020) (1)
On the Time and Space Complexity of Computation Using Write-Once (1988) (1)
Engineering Secure Software and Systems (2017) (1)
When and How Can Data be Efficiently Released with Privacy ? (2008) (1)
Completeness in Two-Party Secure Computation Revisited (2007) (1)
Algorithms for Sensor Systems (2017) (1)
Advances in Cryptology - ASIACRYPT 2004 (2004) (1)
Web-Age Information Management (2015) (1)
Image Analysis and Processing - ICIAP 2017 (2017) (1)
Computer Performance Engineering (2015) (0)
Magic Functions In Memoriam (2014) (0)
Database Systems for Advanced Applications (2015) (0)
A Variant of Non-Adaptive Group Testing and Its Application in Pay-Television via Internet (2018) (0)
Randomized Algorithms 2013 A Lecture 5 – Martingales , Closest Pairs , Hash Tables , Existential Proofs and Codes ∗ (2012) (0)
Parallel Processing and Applied Mathematics (2017) (0)
Editorial Board (1986) (0)
Editorial Board (1995) (0)
Quantum Interaction (2015) (0)
Computational Logistics (2014) (0)
Bet-or-Pass: Adversarially Robust Bloom Filters (2022) (0)
Web Services (2004) (0)
Measuring the Performance Impact of NSEC 5 ( Abstract ) (2016) (0)
Pseudo-Random Permutations with a Pres ribed Stru ture (2012) (0)
Lecture Notes in Computer Science 9691 Commenced (2011) (0)
Computational Linguistics and Intelligent Text Processing (2016) (0)
Computer Vision - ACCV 2014 Workshops (2014) (0)
Image Analysis and Recognition (2004) (0)
Hardware and Software: Verification and Testing (2017) (0)
Editorial Board (2009) (0)
Collaboration and Technology (2016) (0)
Quantum Interaction (2012) (0)
Algebraic Informatics (2015) (0)
Computational Logistics (2012) (0)
Electronic Government (2014) (0)
Evolutionary Computation in Combinatorial Optimization (2013) (0)
Logic Based Program Synthesis and Transformation (2003) (0)
Economics of Grids, Clouds, Systems, and Services (2011) (0)
Editorial Board (2018) (0)
Editorial Board (2007) (0)
Randomized Algorithms 2018 / 9 A Lecture 1 (2018) (0)
Editorial Board (2004) (0)
Editorial Board (2009) (0)
Modelling Ge- Netic Algorithms with Markov Chains. In (1994) (0)
Big Data Analytics (2015) (0)
Mobile Web and Intelligent Information Systems (2017) (0)
Human Centered Computing (2016) (0)
On the Complexity of Statistical Reasoning (extended abtract). (1995) (0)
Foundations of Cryptography 2021-22 Lecture 1 (2021) (0)
Model and Data Engineering (2016) (0)
Software Technologies: Applications and Foundations (2017) (0)
Reachability Problems (2013) (0)
NoN-Greedy Routing Algorithms Are Optimal or Know thy Neighbor’s Neighbor (2007) (0)
Transitive Transfer of Conndence: a Per- Fect Zero-knowledge Interactive Proto- Col for Sat and Beyond. 5.1 Additional Security for the User (1997) (0)
Big Data Computing and Communications (2016) (0)
Matching nuts and bolts ( Extended Abstract ) (1994) (0)
Fundamentals of Software Engineering (2017) (0)
One Bit Algorithms (1988) (0)
Foundations and Practice of Security (2014) (0)
Tight Bounds for Sliding Bloom Filters (2015) (0)
Fast Algorithms for Interactive Coding Zvika Brakerski (2013) (0)
Computing and Combinatorics (2017) (0)
Session details: Session 11B (2011) (0)
Combatting Junk Mail (1993) (0)
Social Informatics (2017) (0)
Broadcast Encrypt ion (1994) (0)
Computer Safety, Reliability, and Security (2016) (0)
Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II (2017) (0)
Ambient Intelligence (2004) (0)
Web-Age Information Management (2011) (0)
Randomized Algorithms 2014 / 5 A Lecture 2 – Maximal Independent Set , Analysis of Randomized Quicksort , Universal Hashing and Dictionaries , Concentration bounds-Chernoff ∗ (2014) (0)
The German-Israeli Workshop / Winter School on Algorithms for Big Data (2017) (0)
Computer Vision and Graphics (2016) (0)
Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
Wired/Wireless Internet Communications (2017) (0)
Frontiers in Algorithmics (2015) (0)
Machines, Computations, and Universality (2015) (0)
NASA Formal Methods (2018) (0)
Constructing Ramsey graphs from small probability spacesMoni NaorIBM Almaden (1992) (0)
Improved Bounds On Interactive Communication (1991) (0)
Provable Security (2016) (0)
Intelligent Computing Theories and Application (2017) (0)
Trusted Systems (2015) (0)
Notes in Computer Science 5646 (2009) (0)
Graph Drawing (2014) (0)
Approximation and Online Algorithms (2013) (0)
Advances in Computational Intelligence (2015) (0)
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery (2019) (0)
Artificial Evolution (2017) (0)
Computer Safety, Reliability, and Security (2014) (0)
Model and Data Engineering (2015) (0)
On the Decisional Complexity of Problems Over the Reals (2001) (0)
Programming Languages (2016) (0)
Product-Focused Software Process Improvement (2012) (0)
Visual Indication while Sharing Items from a Private 3D Portal Room UI to Public Virtual Environments (2018) (0)
Bounded Model Checking for the Existential Part of Real-Time CTL and Knowledge (2018) (0)
String Processing and Information Retrieval (2012) (0)
Non-Malleability : An Introduction and Survey of Recent Developments (2006) (0)
Pattern Recognition and Image Analysis (2015) (0)
Logic and Its Applications (2015) (0)
1 Simultaneous Message Model and Sketching (2016) (0)
Information Security and Cryptology (2015) (0)
Big Data Analytics and Knowledge Discovery (2016) (0)
Editorial Board (2009) (0)
Human-Centered Software Engineering (2012) (0)
Mining Attribute-Based Access Control Policies from Logs (2018) (0)
A Practical Solution against Corrupted Parties and Coercers in Electronic Voting Protocol over the Network (2018) (0)
Protecting Keys: The Trace-and- Revoke Approach (2003) (0)
Internet and Distributed Computing Systems (2015) (0)
Privacy in Statistical Databases (2016) (0)
Mirror Games Against an Open Book Player (2022) (0)
Information Security and Cryptology (2017) (0)
Randomized Algorithms 2022-3 (2022) (0)
Making NSEC 5 Practical for DNSSEC (2017) (0)
Randomized Algorithms 2020-1 Lecture 7 How To Guess Cards with Little Memory∗ (2020) (0)
Privacy Enhancing Technologies (2010) (0)
Cooperative Design, Visualization, and Engineering (2004) (0)
Networked Systems (2015) (0)
Reversible Computation (2015) (0)
Automata, Languages and Programming (2004) (0)
Games and Learning Alliance (2014) (0)
Randomized Algorithms 2020-1 Lecture 10 (2020) (0)
Green, Pervasive, and Cloud Computing (2017) (0)
Randomized Algorithms 2016 / 7 A Lecture 2 (2016) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Moni Naor?

Moni Naor is affiliated with the following schools:

Weizmann Institute of Science

Moni Naor's Academic­Influence.com Rankings

Moni Naor's Degrees

Similar Degrees You Can Earn

Why Is Moni Naor Influential?

Moni Naor's Published Works

Published Works

What Schools Are Affiliated With Moni Naor?

Moni Naor's AcademicInfluence.com Rankings