Ilan Komargodski


Ontology type: schema:Person     


Person Info

NAME

Ilan

SURNAME

Komargodski

Publications in SciGraph latest 50 shown

  • 2021-11-04 Non-malleable Time-Lock Puzzles and Applications in THEORY OF CRYPTOGRAPHY
  • 2021-08-11 Oblivious RAM with Worst-Case Logarithmic Overhead in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2021-08-11 Non-malleable Codes for Bounded Parallel-Time Tampering in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2021-08-11 A Logarithmic Lower Bound for Oblivious RAM (for All Parameters) in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2021-06-16 Multiparty Reusable Non-interactive Secure Computation from LWE in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2021
  • 2021-06-16 Decentralized Multi-authority ABE for DNFs from LWE in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2021
  • 2020-12-09 Secure Massively Parallel Computation for Dishonest Majority in THEORY OF CRYPTOGRAPHY
  • 2020-11-30 A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols in COMBINATORICA
  • 2020-09-07 Impossibility of Strong KDM Security with Auxiliary Input in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2020-05-01 OptORAMa: Optimal Oblivious RAM in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2020-05-01 SPARKs: Succinct Parallelizable Arguments of Knowledge in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2020-05-01 Continuous Verifiable Delay Functions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2019-08-01 Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-06-12 From Minicrypt to Obfustopia via Private-Key Functional Encryption in JOURNAL OF CRYPTOLOGY
  • 2019-04-24 Distributional Collision Resistance Beyond One-Way Functions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2018-08-03 Non-trivial Witness Encryption and Null-iO from Standard Assumptions in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2018-07-24 On Distributional Collision Resistant Hashing in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-07-24 On the Complexity of Compressing Obfuscation in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-05-07 Hardness-Preserving Reductions via Cuckoo Hashing in JOURNAL OF CRYPTOLOGY
  • 2018-03-31 Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation) in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2018-03-31 Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2018-03-31 Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2017-11-17 Non-Interactive Multiparty Computation Without Correlated Randomness in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2017
  • 2017-11-05 Evolving Secret Sharing: Dynamic Thresholds and Robustness in THEORY OF CRYPTOGRAPHY
  • 2017-08-29 Communication with Contextual Uncertainty in COMPUTATIONAL COMPLEXITY
  • 2017-07-29 Be Adaptive, Avoid Overcommitting in ADVANCES IN CRYPTOLOGY – CRYPTO 2017
  • 2017-06-26 Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions in JOURNAL OF CRYPTOLOGY
  • 2017-04-01 From Minicrypt to Obfustopia via Private-Key Functional Encryption in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2017
  • 2017-02-14 Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions in JOURNAL OF CRYPTOLOGY
  • 2016-10-22 Leakage Resilient One-Way Functions: The Auxiliary-Input Setting in THEORY OF CRYPTOGRAPHY
  • 2016-10-21 Threshold Secret Sharing Requires a Linear Size Alphabet in THEORY OF CRYPTOGRAPHY
  • 2016-10-21 How to Share a Secret, Infinitely in THEORY OF CRYPTOGRAPHY
  • 2016-04-28 Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2016
  • 2016-01-14 Secret-Sharing for NP in JOURNAL OF CRYPTOLOGY
  • 2015-12-24 Cutting-Edge Cryptography Through the Lens of Secret Sharing in THEORY OF CRYPTOGRAPHY
  • 2015-11-05 Compressing Communication in Distributed Protocols in DISTRIBUTED COMPUTING
  • 2015 Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions in THEORY OF CRYPTOGRAPHY
  • 2014 Secret-Sharing for NP in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2014
  • 2013 Hardness Preserving Reductions via Cuckoo Hashing 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.9619.7", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.13992.30", 
            "type": "Organization"
          }
        ], 
        "familyName": "Komargodski", 
        "givenName": "Ilan", 
        "id": "sg:person.012204235441.12", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012204235441.12"
        ], 
        "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_674.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.012204235441.12'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...