Gil Segev


Ontology type: schema:Person     


Person Info

NAME

Gil

SURNAME

Segev

Publications in SciGraph latest 50 shown

  • 2018-11-08 Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound in THEORY OF CRYPTOGRAPHY
  • 2018-11-08 The Security of Lazy Users in Out-of-Band Authentication in THEORY OF CRYPTOGRAPHY
  • 2018-11-04 Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier? in THEORY OF CRYPTOGRAPHY
  • 2018-10 Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions in JOURNAL OF CRYPTOLOGY
  • 2018-08-03 Securing Abe’s Mix-Net Against Malicious Verifiers via Witness Indistinguishability in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2018-07-25 Tight Tradeoffs in Searchable Symmetric Encryption in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-07-25 Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-07 On Constructing One-Way Permutations from Indistinguishability Obfuscation in JOURNAL OF CRYPTOLOGY
  • 2018-04 Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions in JOURNAL OF CRYPTOLOGY
  • 2018-03-31 Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2018-01 Function-Private Functional Encryption in the Private-Key Setting in JOURNAL OF CRYPTOLOGY
  • 2018-01 Incremental Deterministic Public-Key Encryption in JOURNAL OF CRYPTOLOGY
  • 2018-01 Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions in JOURNAL OF CRYPTOLOGY
  • 2017 From Minicrypt to Obfustopia via Private-Key Functional Encryption in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2017
  • 2017 Can PPAD Hardness be Based on Standard Cryptographic Assumptions? in THEORY OF CRYPTOGRAPHY
  • 2017 Strengthening the Security of Encrypted Databases: Non-transitive JOINs in THEORY OF CRYPTOGRAPHY
  • 2016-07 An Optimally Fair Coin Toss in JOURNAL OF CRYPTOLOGY
  • 2016 On Constructing One-Way Permutations from Indistinguishability Obfuscation in THEORY OF CRYPTOGRAPHY
  • 2016 Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2016
  • 2015 From Selective to Adaptive Security in Functional Encryption in ADVANCES IN CRYPTOLOGY -- CRYPTO 2015
  • 2015 Function-Private Functional Encryption in the Private-Key Setting in PUBLIC-KEY CRYPTOGRAPHY -- PKC 2015
  • 2015 Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions in PUBLIC-KEY CRYPTOGRAPHY -- PKC 2015
  • 2014-04 Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting in JOURNAL OF CRYPTOLOGY
  • 2014 Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2014
  • 2013-07 Fully Leakage-Resilient Signatures in JOURNAL OF CRYPTOLOGY
  • 2013 Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption in ADVANCES IN CRYPTOLOGY – CRYPTO 2013
  • 2013 Message-Locked Encryption for Lock-Dependent Messages in ADVANCES IN CRYPTOLOGY – CRYPTO 2013
  • 2013 Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2013
  • 2013 Function-Private Subspace-Membership Encryption and Its Applications in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2013
  • 2013-01 More Constructions of Lossy and Correlation-Secure Trapdoor Functions in JOURNAL OF CRYPTOLOGY
  • 2012 Lossy Functions Do Not Amplify Well in THEORY OF CRYPTOGRAPHY
  • 2012 Incremental Deterministic Public-Key Encryption in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2012
  • 2011 Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2011 Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions in THEORY OF CRYPTOGRAPHY
  • 2011 Fully Leakage-Resilient Signatures in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2011
  • 2010-04 Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing in ALGORITHMICA
  • 2010 More Constructions of Lossy and Correlation-Secure Trapdoor Functions in PUBLIC KEY CRYPTOGRAPHY – PKC 2010
  • 2010 Public-Key Encryption in the Bounded-Retrieval Model in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2010
  • 2010 Public-Key Cryptographic Primitives Provably as Secure as Subset Sum in THEORY OF CRYPTOGRAPHY
  • 2009 Hedged Public-Key Encryption: How to Protect against Bad Randomness in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2009
  • 2009 Chosen-Ciphertext Security via Correlated Products in THEORY OF CRYPTOGRAPHY
  • 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
  • 2008 David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 2008 A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval in THEORY OF CRYPTOGRAPHY
  • 2008 History-Independent Cuckoo Hashing in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007 Deterministic History-Independent Strategies for Storing Information on Write-Once Memories in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2006 Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing in ALGORITHMS – ESA 2006
  • 2006 Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • Affiliations

    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": "https://www.grid.ac/institutes/grid.9619.7", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Segev", 
        "givenName": "Gil", 
        "id": "sg:person.016423726453.97", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016423726453.97"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:45", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1535.json", 
        "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.016423726453.97'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...