Moni Naor


Ontology type: schema:Person     


Person Info

NAME

Moni

SURNAME

Naor

Publications in SciGraph latest 50 shown

  • 2019-11-22 Incrementally Verifiable Computation via Incremental PCPs in THEORY OF CRYPTOGRAPHY
  • 2018-11-08 The Security of Lazy Users in Out-of-Band Authentication in THEORY OF CRYPTOGRAPHY
  • 2018-05-07 Hardness-Preserving Reductions via Cuckoo Hashing in JOURNAL OF CRYPTOLOGY
  • 2018-03-31 Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2016-10-21 How to Share a Secret, Infinitely in THEORY OF CRYPTOGRAPHY
  • 2016-07-21 Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption in ADVANCES IN CRYPTOLOGY – CRYPTO 2016
  • 2016-07-21 Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems in ADVANCES IN CRYPTOLOGY – CRYPTO 2016
  • 2016-06-09 When Can Limited Randomness Be Used in Repeated Games? in THEORY OF COMPUTING SYSTEMS
  • 2016-01-14 Secret-Sharing for NP in JOURNAL OF CRYPTOLOGY
  • 2015-12-30 Pure Differential Privacy for Rectangle Queries via Private Partitions in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2015
  • 2015-12-10 When Can Limited Randomness Be Used in Repeated Games? in ALGORITHMIC GAME THEORY
  • 2015-08-01 Bloom Filters in Adversarial Environments in ADVANCES IN CRYPTOLOGY -- CRYPTO 2015
  • 2015-05-13 Tight Bounds for Sliding Bloom Filters in ALGORITHMICA
  • 2015-02-21 An Optimally Fair Coin Toss in JOURNAL OF CRYPTOLOGY
  • 2015 Secure Physical Computation Using Disposable Circuits in THEORY OF CRYPTOGRAPHY
  • 2015 Primary-Secondary-Resolver Membership Proof Systems in THEORY OF CRYPTOGRAPHY
  • 2014 Physical Zero-Knowledge Proofs of Physical Properties in ADVANCES IN CRYPTOLOGY – CRYPTO 2014
  • 2014 Secret-Sharing for NP in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2014
  • 2013 Hardness Preserving Reductions via Cuckoo Hashing in THEORY OF CRYPTOGRAPHY
  • 2013 Sliding Bloom Filters in ALGORITHMS AND COMPUTATION
  • 2010-09-30 Efficient trace and revoke schemes in INTERNATIONAL JOURNAL OF INFORMATION SECURITY
  • 2010 Public-Key Encryption in the Bounded-Retrieval Model in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2010
  • 2009 Hedged Public-Key Encryption: How to Protect against Bad Randomness in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2009
  • 2009 De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2009 An Optimally Fair Coin Toss in THEORY OF CRYPTOGRAPHY
  • 2009 Public-Key Cryptosystems Resilient to Key Leakage in ADVANCES IN CRYPTOLOGY - CRYPTO 2009
  • 2009 How Efficient Can Memory Checking Be? in THEORY OF CRYPTOGRAPHY
  • 2008-12-25 Derandomized Constructions of k-Wise (Almost) Independent Permutations in ALGORITHMICA
  • 2008-05-30 Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles in THEORY OF COMPUTING SYSTEMS
  • 2008-01-01 Cryptography and Game Theory: Designing Protocols for Exchanging Information in THEORY OF CRYPTOGRAPHY
  • 2008-01-01 History-Independent Cuckoo Hashing in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007 Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles in FUN WITH ALGORITHMS
  • 2007 Implementing Huge Sparse Random Graphs in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2007-01-01 Deterministic History-Independent Strategies for Storing Information on Write-Once Memories in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2006-05-24 Completeness in Two-Party Secure Computation: A Computational View in JOURNAL OF CRYPTOLOGY
  • 2006 Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • 2006 Our Data, Ourselves: Privacy Via Distributed Noise Generation in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2006
  • 2006 On Everlasting Security in the Hybrid Bounded Storage Model in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2006 Receipt-Free Universally-Verifiable Voting with Everlasting Privacy in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • 2006 Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2006
  • 2005-05 Scalable and dynamic quorum systems in DISTRIBUTED COMPUTING
  • 2005 The Dynamic And-Or Quorum System in DISTRIBUTED COMPUTING
  • 2005 On Robust Combiners for Oblivious Transfer and Other Primitives in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2005 Pebbling and Proofs of Work in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • 2005 Basing Cryptographic Protocols on Tamper-Evident Seals in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 Know Thy Neighbor’s Neighbor: Better Routing for Skip-Graphs and Small Worlds in PEER-TO-PEER SYSTEMS III
  • 2005 Derandomized Constructions of k-Wise (Almost) Independent Permutations in APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2005 Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs in THEORY OF CRYPTOGRAPHY
  • 2004-10-21 Computationally Secure Oblivious Transfer in JOURNAL OF CRYPTOLOGY
  • 2004 Fault-Tolerant Storage in a Dynamic Environment in DISTRIBUTED COMPUTING
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.13992.30", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.47840.3f", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.473686.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.481551.c", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.410441.4", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.21166.32", 
            "type": "Organization"
          }
        ], 
        "familyName": "Naor", 
        "givenName": "Moni", 
        "id": "sg:person.07776170271.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2021-11-01T19:31", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/person/person_700.jsonl", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.07776170271.83'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.07776170271.83'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.07776170271.83'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.07776170271.83'


     

    This table displays all metadata directly associated to this object as RDF triples.

    26 TRIPLES      10 PREDICATES      16 URIs      7 LITERALS      2 BLANK NODES

    Subject Predicate Object
    1 sg:person.07776170271.83 schema:affiliation N0957f34d46914e3eaa971505b2f5a3c2
    2 grid-institutes:grid.21166.32
    3 grid-institutes:grid.410441.4
    4 grid-institutes:grid.473686.8
    5 grid-institutes:grid.47840.3f
    6 grid-institutes:grid.481551.c
    7 schema:familyName Naor
    8 schema:givenName Moni
    9 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83
    10 schema:sdDatePublished 2021-11-01T19:31
    11 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    12 schema:sdPublisher Ne625a9d7783e4a1382cdec5cd3960317
    13 sgo:license sg:explorer/license/
    14 sgo:sdDataset persons
    15 rdf:type schema:Person
    16 N0957f34d46914e3eaa971505b2f5a3c2 schema:affiliation grid-institutes:grid.13992.30
    17 sgo:isCurrent true
    18 rdf:type schema:OrganizationRole
    19 Ne625a9d7783e4a1382cdec5cd3960317 schema:name Springer Nature - SN SciGraph project
    20 rdf:type schema:Organization
    21 grid-institutes:grid.13992.30 schema:Organization
    22 grid-institutes:grid.21166.32 schema:Organization
    23 grid-institutes:grid.410441.4 schema:Organization
    24 grid-institutes:grid.473686.8 schema:Organization
    25 grid-institutes:grid.47840.3f schema:Organization
    26 grid-institutes:grid.481551.c schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...