Benny Pinkas


Ontology type: schema:Person     


Person Info

NAME

Benny

SURNAME

Pinkas

Publications in SciGraph latest 50 shown

  • 2021-08-11 Oblivious Key-Value Stores and Amplification for Private Set Intersection in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2020-05-01 PSI from PaXoS: Fast, Malicious Private Set Intersection in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2020
  • 2019-08-01 SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension in ADVANCES IN CRYPTOLOGY – CRYPTO 2019
  • 2019-04-26 Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ in JOURNAL OF CRYPTOLOGY
  • 2019-04-24 Efficient Circuit-Based PSI with Linear Communication in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2018-08-03 Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2018-07-24 Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-06-10 Distributed SSH Key Management with Proactive RSA Threshold Signatures in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2018-03-31 Efficient Circuit-Based PSI via Cuckoo Hashing in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2018-03-01 Committed MPC in PUBLIC-KEY CRYPTOGRAPHY – PKC 2018
  • 2017-12-11 Fast Garbling of Circuits Under Standard Assumptions in JOURNAL OF CRYPTOLOGY
  • 2017-02-26 Asymptotically Tight Bounds for Composing ORAM with PIR in PUBLIC-KEY CRYPTOGRAPHY – PKC 2017
  • 2015-08-01 Efficient Constant Round Multi-party Computation Combining BMR and SPDZ in ADVANCES IN CRYPTOLOGY -- CRYPTO 2015
  • 2014-10-24 Efficient Set Intersection with Simulation-Based Security in JOURNAL OF CRYPTOLOGY
  • 2014-04-10 An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries in JOURNAL OF CRYPTOLOGY
  • 2014 Non-Interactive Secure Computation Based on Cut-and-Choose in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2014
  • 2012 Firm Grip Handshakes: A Tool for Bidirectional Vouching in CRYPTOLOGY AND NETWORK SECURITY
  • 2011-09-03 Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer in JOURNAL OF CRYPTOLOGY
  • 2011 Secure Computation on the Web: Computing without Simultaneous Interaction in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2011 Secure Set Intersection with Untrusted Hardware Tokens in TOPICS IN CRYPTOLOGY – CT-RSA 2011
  • 2011 The IPS Compiler: Optimizations, Variants and Concrete Efficiency in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2011 Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer in THEORY OF CRYPTOGRAPHY
  • 2011 Traitor Tracing in ENCYCLOPEDIA OF CRYPTOGRAPHY AND SECURITY
  • 2010-09-30 Efficient trace and revoke schemes in INTERNATIONAL JOURNAL OF INFORMATION SECURITY
  • 2010-02-05 Secure Computation of the Median (and Other Elements of Specified Ranks) in JOURNAL OF CRYPTOLOGY
  • 2010 Oblivious RAM Revisited in ADVANCES IN CRYPTOLOGY – CRYPTO 2010
  • 2010 Privacy-Preserving Group Discovery with Linear Complexity in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2009-06-10 Peer-to-peer secure multi-party numerical computation facing malicious adversaries in PEER-TO-PEER NETWORKING AND APPLICATIONS
  • 2009 Secure Two-Party Computation Is Practical in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2009
  • 2009 Secure Hamming Distance Based Computation and Its Applications in APPLIED CRYPTOGRAPHY AND NETWORK SECURITY
  • 2008-12-09 A Proof of Security of Yao’s Protocol for Two-Party Computation in JOURNAL OF CRYPTOLOGY
  • 2008-05-30 Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles in THEORY OF COMPUTING SYSTEMS
  • 2008 Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2007 Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles in FUN WITH ALGORITHMS
  • 2007 An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2007
  • 2005 Keyword Search and Oblivious Pseudorandom Functions in THEORY OF CRYPTOGRAPHY
  • 2005 Traitor Tracing in ENCYCLOPEDIA OF CRYPTOGRAPHY AND SECURITY
  • 2004-10-21 Computationally Secure Oblivious Transfer in JOURNAL OF CRYPTOLOGY
  • 2004 Secure Computation of the kth-Ranked Element in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004
  • 2004 Efficient Private Matching and Set Intersection in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004
  • 2003-05-13 Fair Secure Two-Party Computation in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2003
  • 2003 The Design and Implementation of Protocol-Based Hidden Key Recovery in INFORMATION SECURITY
  • 2002-05-07 Efficient State Updates for Key Management in SECURITY AND PRIVACY IN DIGITAL RIGHTS MANAGEMENT
  • 2001-10-26 Efficient Trace and Revoke Schemes in FINANCIAL CRYPTOGRAPHY
  • 2000-10-27 Distributed Oblivious Transfer in ADVANCES IN CRYPTOLOGY — ASIACRYPT 2000
  • 2000-08-11 Privacy Preserving Data Mining in ADVANCES IN CRYPTOLOGY — CRYPTO 2000
  • 1999-12-16 Oblivious Transfer with Adaptive Queries in ADVANCES IN CRYPTOLOGY — CRYPTO’ 99
  • 1999-04-15 Distributed Pseudo-random Functions and KDCs in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’99
  • 1998 Threshold traitor tracing in ADVANCES IN CRYPTOLOGY — CRYPTO '98
  • 1998 Secure and efficient metering in ADVANCES IN CRYPTOLOGY — EUROCRYPT'98
  • 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.22098.31", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.6451.6", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.18098.38", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.13992.30", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.9619.7", 
            "type": "Organization"
          }
        ], 
        "familyName": "Pinkas", 
        "givenName": "Benny", 
        "id": "sg:person.07416054235.47", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07416054235.47"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-05-10T11:28", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/person/person_641.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.07416054235.47'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...