Adam Smith


Ontology type: schema:Person     


Person Info

NAME

Adam

SURNAME

Smith

Publications in SciGraph latest 50 shown

  • 2021-07-01 Turning HATE into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC in CYBER SECURITY CRYPTOGRAPHY AND MACHINE LEARNING
  • 2020-11-23 Reusable Fuzzy Extractors for Low-Entropy Distributions in JOURNAL OF CRYPTOLOGY
  • 2019-04-18 Distributed Differential Privacy via Shuffling in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2016-11-09 When Are Fuzzy Extractors Possible? in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2016
  • 2016-09-19 Instantiability of RSA-OAEP Under Chosen-Plaintext Attack in JOURNAL OF CRYPTOLOGY
  • 2016-04-28 Reusable Fuzzy Extractors for Low-Entropy Distributions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2016
  • 2016-04-22 Differentially Private Analysis of Graphs in ENCYCLOPEDIA OF ALGORITHMS
  • 2015-08-11 Private Analysis of Graph Data in ENCYCLOPEDIA OF ALGORITHMS
  • 2015 On the Regularity of Lossy RSA in THEORY OF CRYPTOGRAPHY
  • 2014-04-18 Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs in JOURNAL OF CRYPTOLOGY
  • 2013 Analyzing Graphs with Node Differential Privacy in THEORY OF CRYPTOGRAPHY
  • 2013 Regularity of Lossy RSA on Subdomains and Its Applications in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2013
  • 2012-02-22 Sublinear Algorithms for Approximating String Compressibility in ALGORITHMICA
  • 2011 Classical Cryptographic Protocols in a Quantum World in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2010-02-17 Parallel and Concurrent Security of the HB and HB+ Protocols in JOURNAL OF CRYPTOLOGY
  • 2010 Instantiability of RSA-OAEP under Chosen-Plaintext Attack in ADVANCES IN CRYPTOLOGY – CRYPTO 2010
  • 2009 Composability and On-Line Deniability of Authentication in THEORY OF CRYPTOGRAPHY
  • 2009 Asymptotically Optimal and Private Statistical Estimation in CRYPTOLOGY AND NETWORK SECURITY
  • 2008-01-01 Efficient Two Party and Multi Party Computation Against Covert Adversaries in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 2008-01-01 Scalable Multiparty Computation with Nearly Optimal Work and Resilience in ADVANCES IN CRYPTOLOGY – CRYPTO 2008
  • 2007 Sublinear Algorithms for Approximating String Compressibility in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2007 Fuzzy Extractors in SECURITY WITH NOISY DATA
  • 2006 Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • 2006 Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • 2006 Calibrating Noise to Sensitivity in Private Data Analysis in THEORY OF CRYPTOGRAPHY
  • 2005 Entropic Security and the Encryption of High Entropy Messages in THEORY OF CRYPTOGRAPHY
  • 2005 Secure Remote Authentication Using Biometric Data in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2005 Toward Privacy in Public Databases in THEORY OF CRYPTOGRAPHY
  • 2005 Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2004 Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2004 List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument in THEORY OF CRYPTOGRAPHY
  • 2004 Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004
  • 2004 Efficient Consistency Proofs for Generalized Queries on a Committed Database in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2003-05-13 Round Efficiency of Multi-party Computation with a Dishonest Majority in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2003
  • 2001-11-20 Mutually Independent Commitments in ADVANCES IN CRYPTOLOGY — ASIACRYPT 2001
  • 2001-04-15 On Perfect and Adaptive Security in Exposure-Resilient Cryptography in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2001
  • 2001-04-15 Efficient and Non-interactive Non-malleable Commitment in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2001
  • 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.189504.1", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.29857.31", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.13992.30", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }
        ], 
        "familyName": "Smith", 
        "givenName": "Adam", 
        "id": "sg:person.013307226666.21", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013307226666.21"
        ], 
        "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_974.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.013307226666.21'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...