Rafail M Ostrovsky


Ontology type: schema:Person     


Person Info

NAME

Rafail M

SURNAME

Ostrovsky

Publications in SciGraph latest 50 shown

  • 2022-06-23 A Linear-Time 2-Party Secure Merge Protocol in CYBER SECURITY, CRYPTOLOGY, AND MACHINE LEARNING
  • 2022-06-23 FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker in CYBER SECURITY, CRYPTOLOGY, AND MACHINE LEARNING
  • 2022-05-25 Round-Optimal and Communication-Efficient Multiparty Computation in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2022
  • 2022-05-25 Adaptively Secure Computation for RAM Programs in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2022
  • 2022-05-25 Garbled Circuits with Sublinear Evaluator in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2022
  • 2022-05-25 EpiGRAM: Practical Garbled RAM in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2022
  • 2022-05-02 Succinct Non-Interactive Arguments via Linear Interactive Proofs in JOURNAL OF CRYPTOLOGY
  • 2022-02-27 CNF-FSS and Its Applications in PUBLIC-KEY CRYPTOGRAPHY – PKC 2022
  • 2021-12-01 How to Build a Trapdoor Function from an Encryption Scheme in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2021
  • 2021-11-04 Oblivious Transfer from Trapdoor Permutations in Minimal Rounds in THEORY OF CRYPTOGRAPHY
  • 2021-08-11 ATLAS: Efficient and Scalable MPC in the Honest Majority Setting in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2021-06-16 Threshold Garbled Circuits and Ad Hoc Secure Computation in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2021
  • 2021-06-16 Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2021
  • 2020-12-09 Round Optimal Secure Multiparty Computation from Minimal Assumptions in THEORY OF CRYPTOGRAPHY
  • 2020-12-09 Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More in THEORY OF CRYPTOGRAPHY
  • 2020-12-08 Proof-of-Reputation Blockchain with Nakamoto Fallback in PROGRESS IN CRYPTOLOGY – INDOCRYPT 2020
  • 2020-11-25 A Combinatorial Characterization of Self-stabilizing Population Protocols in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2020-09-07 Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2020-09-07 Oblivious Tight Compaction In O(n) Time with Smaller Constant in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2020-09-07 Efficient 3-Party Distributed ORAM in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2020-08-10 On Succinct Arguments and Witness Encryption from Groups in ADVANCES IN CRYPTOLOGY – CRYPTO 2020
  • 2020-05-12 Oblivious Sampling with Applications to Two-Party k-Means Clustering in JOURNAL OF CRYPTOLOGY
  • 2020-05-01 Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2019-11-22 UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2019
  • 2019-11-22 Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND in THEORY OF CRYPTOGRAPHY
  • 2019-08-01 Trapdoor Hash Functions and Their Applications in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-08-01 Cryptographic Sensing in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-08-01 Reusable Non-Interactive Secure Computation in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-08-01 Universally Composable Secure Computation with Corrupted Tokens in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-04-24 Private Anonymous Data Access in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2018-11-30 Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation in FROM DATABASE TO CYBER SECURITY
  • 2018-11-04 Information-Theoretic Broadcast with Dishonest Majority for Long Messages in THEORY OF CRYPTOGRAPHY
  • 2018-11-04 Round Optimal Black-Box “Commit-and-Prove” in THEORY OF CRYPTOGRAPHY
  • 2018-10-26 Non-interactive Secure Computation from One-Way Functions in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2018
  • 2018-08-03 Proactive Secure Multiparty Computation with a Dishonest Majority in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2018-07-24 Adaptive Garbled RAM from Laconic Oblivious Transfer in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-07-24 Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-03-01 On the Message Complexity of Secure Multiparty Computation in PUBLIC-KEY CRYPTOGRAPHY – PKC 2018
  • 2017-12-30 Space-Time Tradeoffs for Distributed Verification in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2017-11-05 Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds in THEORY OF CRYPTOGRAPHY
  • 2017-11-05 Resettably-Sound Resettable Zero Knowledge in Constant Rounds in THEORY OF CRYPTOGRAPHY
  • 2017-11-05 Round-Optimal Secure Two-Party Computation from Trapdoor Permutations in THEORY OF CRYPTOGRAPHY
  • 2017-08-24 Special Issue: Algorithmic Tools in Cryptography in ALGORITHMICA
  • 2017-07-29 The Price of Low Communication in Secure Multi-party Computation in ADVANCES IN CRYPTOLOGY – CRYPTO 2017
  • 2017-07-29 Four-Round Concurrent Non-Malleable Commitments from One-Way Functions in ADVANCES IN CRYPTOLOGY – CRYPTO 2017
  • 2017-07-29 Black-Box Parallel Garbled RAM in ADVANCES IN CRYPTOLOGY – CRYPTO 2017
  • 2017-04-01 Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2017
  • 2017-03-07 Efficient robust secret sharing from expander graphs in CRYPTOGRAPHY AND COMMUNICATIONS
  • 2017-02-26 Circuit-Private Multi-key FHE in PUBLIC-KEY CRYPTOGRAPHY – PKC 2017
  • 2016-08-11 Proactive Secret Sharing with a Dishonest Majority in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 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.19006.3e", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.189504.1", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.11780.3f", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.273335.3", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.421375.6", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.185107.a", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.480024.a", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.432790.b", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.47840.3f", 
            "type": "Organization"
          }
        ], 
        "familyName": "Ostrovsky", 
        "givenName": "Rafail M", 
        "id": "sg:person.015474716573.95", 
        "identifier": [
          {
            "name": "orcid_id", 
            "type": "PropertyValue", 
            "value": "0000-0002-1501-1330"
          }
        ], 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95", 
          "https://orcid.org/0000-0002-1501-1330"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-08-04T17:38", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/person/person_799.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.015474716573.95'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     

    This table displays all metadata directly associated to this object as RDF triples.

    39 TRIPLES      11 PREDICATES      22 URIs      8 LITERALS      3 BLANK NODES

    Subject Predicate Object
    1 sg:person.015474716573.95 schema:affiliation N2581cd1884ec4c39abfb10fa63aa985b
    2 grid-institutes:grid.116068.8
    3 grid-institutes:grid.11780.3f
    4 grid-institutes:grid.185107.a
    5 grid-institutes:grid.189504.1
    6 grid-institutes:grid.273335.3
    7 grid-institutes:grid.421375.6
    8 grid-institutes:grid.432790.b
    9 grid-institutes:grid.47840.3f
    10 grid-institutes:grid.480024.a
    11 schema:familyName Ostrovsky
    12 schema:givenName Rafail M
    13 schema:identifier Nd52650c2dbaa48409d5d3a926e4ec001
    14 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95
    15 https://orcid.org/0000-0002-1501-1330
    16 schema:sdDatePublished 2022-08-04T17:38
    17 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    18 schema:sdPublisher N151df941b9fa49c9903532e5f5bb6894
    19 sgo:license sg:explorer/license/
    20 sgo:sdDataset persons
    21 rdf:type schema:Person
    22 N151df941b9fa49c9903532e5f5bb6894 schema:name Springer Nature - SN SciGraph project
    23 rdf:type schema:Organization
    24 N2581cd1884ec4c39abfb10fa63aa985b schema:affiliation grid-institutes:grid.19006.3e
    25 sgo:isCurrent true
    26 rdf:type schema:OrganizationRole
    27 Nd52650c2dbaa48409d5d3a926e4ec001 schema:name orcid_id
    28 schema:value 0000-0002-1501-1330
    29 rdf:type schema:PropertyValue
    30 grid-institutes:grid.116068.8 schema:Organization
    31 grid-institutes:grid.11780.3f schema:Organization
    32 grid-institutes:grid.185107.a schema:Organization
    33 grid-institutes:grid.189504.1 schema:Organization
    34 grid-institutes:grid.19006.3e schema:Organization
    35 grid-institutes:grid.273335.3 schema:Organization
    36 grid-institutes:grid.421375.6 schema:Organization
    37 grid-institutes:grid.432790.b schema:Organization
    38 grid-institutes:grid.47840.3f schema:Organization
    39 grid-institutes:grid.480024.a schema:Organization
     




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


    ...