Dana Dachman-Soled


Ontology type: schema:Person     


Person Info

NAME

Dana

SURNAME

Dachman-Soled

Publications in SciGraph latest 50 shown

  • 2021-11-04 BKW Meets Fourier New Algorithms for LPN with Sparse Parities in THEORY OF CRYPTOGRAPHY
  • 2021-08-11 Non-malleable Codes for Bounded Parallel-Time Tampering in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2020-12-09 Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures in THEORY OF CRYPTOGRAPHY
  • 2020-12-04 Security of NewHope Under Partial Key Exposure in RESEARCH IN MATHEMATICS AND PUBLIC POLICY
  • 2020-08-25 Transparency Tools for Fairness in AI (Luskin) in RESEARCH IN MATHEMATICS AND PUBLIC POLICY
  • 2020-08-10 LWE with Side Information: Attacks and Concrete Security Estimation in ADVANCES IN CRYPTOLOGY – CRYPTO 2020
  • 2020-08-10 New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust in ADVANCES IN CRYPTOLOGY – CRYPTO 2020
  • 2020-02-14 TMPS: Ticket-Mediated Password Strengthening in TOPICS IN CRYPTOLOGY – CT-RSA 2020
  • 2019-07-14 Constant-Round Group Key Exchange from the Ring-LWE Assumption in POST-QUANTUM CRYPTOGRAPHY
  • 2019-07-09 Feasibility and Infeasibility of Secure Computation with Malicious PUFs in JOURNAL OF CRYPTOLOGY
  • 2019-04-18 Non-Malleable Codes Against Bounded Polynomial Time Tampering in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2019-04-06 Upper and Lower Bounds for Continuous Non-Malleable Codes in PUBLIC-KEY CRYPTOGRAPHY – PKC 2019
  • 2018-11-27 Locally Decodable and Updatable Non-malleable Codes and Their Applications in JOURNAL OF CRYPTOLOGY
  • 2018-08-09 Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness in JOURNAL OF CRYPTOLOGY
  • 2018-04-25 Leakage Resilience from Program Obfuscation in JOURNAL OF CRYPTOLOGY
  • 2018-03-31 Non-malleable Codes from Average-Case Hardness: , Decision Trees, and Streaming Space-Bounded Tampering in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2018-03-01 Local Non-malleable Codes in the Bounded Retrieval Model in PUBLIC-KEY CRYPTOGRAPHY – PKC 2018
  • 2017-03-16 Improved, black-box, non-malleable encryption from semantic security in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2017-03-13 A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption in JOURNAL OF CRYPTOLOGY
  • 2017-02-26 Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes in PUBLIC-KEY CRYPTOGRAPHY – PKC 2017
  • 2016-10-21 Towards Non-Black-Box Separations of Public Key Encryption and One Way Function in THEORY OF CRYPTOGRAPHY
  • 2016-04-28 10-Round Feistel is Indifferentiable from an Ideal Cipher in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2016
  • 2016-04-28 Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2016
  • 2016-02-18 Leakage-Resilient Public-Key Encryption from Obfuscation in PUBLIC-KEY CRYPTOGRAPHY – PKC 2016
  • 2016-02-02 Efficient Concurrent Covert Computation of String Equality and Set Intersection in TOPICS IN CRYPTOLOGY - CT-RSA 2016
  • 2015 Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness in ADVANCES IN CRYPTOLOGY -- ASIACRYPT 2015
  • 2015 Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds in THEORY OF CRYPTOGRAPHY
  • 2015 Locally Decodable and Updatable Non-malleable Codes and Their Applications in THEORY OF CRYPTOGRAPHY
  • 2014 On Minimal Assumptions for Sender-Deniable Public Key Encryption in PUBLIC-KEY CRYPTOGRAPHY – PKC 2014
  • 2014 Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? in THEORY OF CRYPTOGRAPHY
  • 2014 A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption Scheme in PUBLIC-KEY CRYPTOGRAPHY – PKC 2014
  • 2014 Enhanced Chosen-Ciphertext Security and Applications in PUBLIC-KEY CRYPTOGRAPHY – PKC 2014
  • 2014 Leakage-Tolerant Computation with Input-Independent Preprocessing in ADVANCES IN CRYPTOLOGY – CRYPTO 2014
  • 2014 Securing Circuits and Protocols against 1/poly(k) Tampering Rate in THEORY OF CRYPTOGRAPHY
  • 2014 Feasibility and Infeasibility of Secure Computation with Malicious PUFs in ADVANCES IN CRYPTOLOGY – CRYPTO 2014
  • 2013 Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2013
  • 2013 Why “Fiat-Shamir for Proofs” Lacks a Proof in THEORY OF CRYPTOGRAPHY
  • 2012 Securing Circuits against Constant-Rate Tampering in ADVANCES IN CRYPTOLOGY – CRYPTO 2012
  • 2012 Computational Extractors and Pseudorandomness in THEORY OF CRYPTOGRAPHY
  • 2012 Efficient Password Authenticated Key Exchange via Oblivious Transfer in PUBLIC KEY CRYPTOGRAPHY – PKC 2012
  • 2012 On the Centrality of Off-Line E-Cash to Concrete Partial Information Games in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2011 A Canonical Form for Testing Boolean Function Properties in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011 Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2011 On the Black-Box Complexity of Optimally-Fair Coin Tossing in THEORY OF CRYPTOGRAPHY
  • 2009 Efficient Robust Private Set Intersection in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2009 Improved Non-committing Encryption with Applications to Adaptively Secure Protocols in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2009
  • 2009 Simple, Black-Box Constructions of Adaptively Secure Protocols in THEORY OF CRYPTOGRAPHY
  • 2008-01-01 Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One in THEORY OF CRYPTOGRAPHY
  • 2008 Optimal Cryptographic Hardness of Learning Monotone Functions in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 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.164295.d", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.410443.6", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.419815.0", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.21729.3f", 
            "type": "Organization"
          }
        ], 
        "familyName": "Dachman-Soled", 
        "givenName": "Dana", 
        "id": "sg:person.011244513001.85", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011244513001.85"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:58", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/person/person_9.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.011244513001.85'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...