Guy N Rothblum


Ontology type: schema:Person     


Person Info

NAME

Guy N

SURNAME

Rothblum

Publications in SciGraph latest 50 shown

  • 2020-12-09 Batch Verification for Statistical Zero Knowledge Proofs in THEORY OF CRYPTOGRAPHY
  • 2020-12-09 Batch Verification and Proofs of Proximity with Polylog Overhead in THEORY OF CRYPTOGRAPHY
  • 2020-09-07 Developing a COVID-19 mortality risk prediction model when individual-level data are not available in NATURE COMMUNICATIONS
  • 2020-04-04 Worst-Case to Average-Case Reductions for Subclasses of P in COMPUTATIONAL COMPLEXITY AND PROPERTY TESTING
  • 2020-04-04 Constant-Round Interactive Proof Systems for AC0[2] and NC1 in COMPUTATIONAL COMPLEXITY AND PROPERTY TESTING
  • 2019-11-22 Incrementally Verifiable Computation via Incremental PCPs in THEORY OF CRYPTOGRAPHY
  • 2017-11-05 On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments in THEORY OF CRYPTOGRAPHY
  • 2017-07-29 From Obfuscation to the Security of Fiat-Shamir for Proofs in ADVANCES IN CRYPTOLOGY – CRYPTO 2017
  • 2016-07-21 Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems in ADVANCES IN CRYPTOLOGY – CRYPTO 2016
  • 2015-12-30 Pure Differential Privacy for Rectangle Queries via Private Partitions in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2015
  • 2015-11-23 Obfuscating Conjunctions in JOURNAL OF CRYPTOLOGY
  • 2014 Fast Pseudorandomness for Independence and Load Balancing in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014 Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding in THEORY OF CRYPTOGRAPHY
  • 2013-05-22 On Best-Possible Obfuscation in JOURNAL OF CRYPTOLOGY
  • 2013 Obfuscating Conjunctions in ADVANCES IN CRYPTOLOGY – CRYPTO 2013
  • 2012 How to Compute under Leakage without Secure Hardware in ADVANCES IN CRYPTOLOGY – CRYPTO 2012
  • 2012 Two Protocols for Delegation of Computation in INFORMATION THEORETIC SECURITY
  • 2011 Program Obfuscation with Leaky Hardware in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2011
  • 2010-09-08 Securely Obfuscating Re-Encryption in JOURNAL OF CRYPTOLOGY
  • 2010-05-14 Are PCPs Inherent in Efficient Arguments? in COMPUTATIONAL COMPLEXITY
  • 2010 Securing Computation against Continuous Leakage in ADVANCES IN CRYPTOLOGY – CRYPTO 2010
  • 2010 Obfuscation of Hyperplane Membership in THEORY OF CRYPTOGRAPHY
  • 2009 Weak Verifiable Random Functions in THEORY OF CRYPTOGRAPHY
  • 2009 How Efficient Can Memory Checking Be? in THEORY OF CRYPTOGRAPHY
  • 2008-05-30 Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles in THEORY OF COMPUTING SYSTEMS
  • 2008-01-01 The Complexity of Local List Decoding in APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2008-01-01 One-Time Programs in ADVANCES IN CRYPTOLOGY – CRYPTO 2008
  • 2007 Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles in FUN WITH ALGORITHMS
  • 2007-01-01 Securely Obfuscating Re-encryption in THEORY OF CRYPTOGRAPHY
  • 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.420463.7", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.419815.0", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.16750.35", 
            "type": "Organization"
          }
        ], 
        "familyName": "Rothblum", 
        "givenName": "Guy N", 
        "id": "sg:person.014351474277.34", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014351474277.34"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-05-20T08:05", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/person/person_887.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.014351474277.34'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...