Rafael N Pass


Ontology type: schema:Person     


Person Info

NAME

Rafael N

SURNAME

Pass

Publications in SciGraph latest 50 shown

  • 2021-11-04 Non-malleable Time-Lock Puzzles and Applications in THEORY OF CRYPTOGRAPHY
  • 2021-08-11 Non-malleable Codes for Bounded Parallel-Time Tampering in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2021-08-11 On the Possibility of Basing Cryptography on EXP≠BPP in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2020-12-06 On the Adaptive Security of MACs and PRFs in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2020
  • 2020-09-07 Impossibility of Strong KDM Security with Auxiliary Input in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2020-09-07 Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2020-05-01 Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2020-05-01 SPARKs: Succinct Parallelizable Arguments of Knowledge in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2020-05-01 Succinct Non-interactive Secure Computation in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2020-05-01 Continuous Verifiable Delay Functions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2020-04-29 Sublinear-Round Byzantine Agreement Under Corrupt Majority in PUBLIC-KEY CRYPTOGRAPHY – PKC 2020
  • 2019-09-30 Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2019-09-30 Minimizing Trust in Hardware Wallets with Two Factor Signatures in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2019-09-16 On the Existence of Nash Equilibrium in Games with Resource-Bounded Players in ALGORITHMIC GAME THEORY
  • 2019-08-01 Synchronous, with a Chance of Partition Tolerance in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-08-01 Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-04-24 Locality-Preserving Oblivious RAM in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2019-04-18 Consensus Through Herding in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2018-11-04 Game Theoretic Notions of Fairness in Multi-party Coin Toss in THEORY OF CRYPTOGRAPHY
  • 2018-11-04 Achieving Fair Treatment in Algorithmic Classification in THEORY OF CRYPTOGRAPHY
  • 2018-11-04 On the Security Loss of Unique Signatures in THEORY OF CRYPTOGRAPHY
  • 2018-07-24 On the Complexity of Compressing Obfuscation in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-06-18 Game theory with translucent players in INTERNATIONAL JOURNAL OF GAME THEORY
  • 2018-03-31 Thunderella: Blockchains with Optimistic Instant Confirmation in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2017-11-25 Socially Optimal Mining Pools in WEB AND INTERNET ECONOMICS
  • 2017-11-18 The Sleepy Model of Consensus in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2017
  • 2017-11-05 Can We Access a Database Both Locally and Privately? in THEORY OF CRYPTOGRAPHY
  • 2017-04-01 Analysis of the Blockchain Protocol in Asynchronous Networks in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2017
  • 2017-04-01 Formal Abstractions for Attested Execution Secure Processors in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2017
  • 2016-10-05 On the Impossibility of Cryptography with Tamperable Randomness in ALGORITHMICA
  • 2016-08-11 Bounded KDM Security from iO and OWF in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2016-04-19 Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments in COMPUTATIONAL COMPLEXITY
  • 2016-02-18 Indistinguishability Obfuscation with Non-trivial Efficiency in PUBLIC-KEY CRYPTOGRAPHY – PKC 2016
  • 2015-12-30 Limits of Extractability Assumptions with Distributional Auxiliary Input in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2015
  • 2015-12-24 Oblivious Parallel RAM and Applications in THEORY OF CRYPTOGRAPHY
  • 2015-12-19 Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings in THEORY OF CRYPTOGRAPHY
  • 2015-12-19 Output-Compressing Randomized Encodings and Applications in THEORY OF CRYPTOGRAPHY
  • 2015-12-19 Lower Bounds on Assumptions Behind Indistinguishability Obfuscation in THEORY OF CRYPTOGRAPHY
  • 2015-08-01 Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs in ADVANCES IN CRYPTOLOGY -- CRYPTO 2015
  • 2015-08-01 Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation in ADVANCES IN CRYPTOLOGY -- CRYPTO 2015
  • 2015 Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence in THEORY OF CRYPTOGRAPHY
  • 2015 Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma in THEORY OF CRYPTOGRAPHY
  • 2015 Outlier Privacy in THEORY OF CRYPTOGRAPHY
  • 2015 From Weak to Strong Zero-Knowledge and Applications in THEORY OF CRYPTOGRAPHY
  • 2014 On the Impossibility of Black-Box Transformations in Mechanism Design in ALGORITHMIC GAME THEORY
  • 2014 On Extractability Obfuscation in THEORY OF CRYPTOGRAPHY
  • 2014 On the Impossibility of Cryptography with Tamperable Randomness in ADVANCES IN CRYPTOLOGY – CRYPTO 2014
  • 2014 4-Round Resettably-Sound Zero Knowledge in THEORY OF CRYPTOGRAPHY
  • 2014 Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings in ADVANCES IN CRYPTOLOGY – CRYPTO 2014
  • 2014 Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players in WEB AND INTERNET ECONOMICS
  • 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.5386.8", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.5037.1", 
            "type": "Organization"
          }
        ], 
        "familyName": "Pass", 
        "givenName": "Rafael N", 
        "id": "sg:person.011042626001.74", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011042626001.74"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:57", 
        "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_760.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.011042626001.74'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...