Tal Rabin


Ontology type: schema:Person     


Person Info

NAME

Tal

SURNAME

Rabin

Publications in SciGraph latest 50 shown

  • 2021-08-11 YOSO: You Only Speak Once in ADVANCES IN CRYPTOLOGY – CRYPTO 2021
  • 2021-02-09 On the Local Leakage Resilience of Linear Secret Sharing Schemes in JOURNAL OF CRYPTOLOGY
  • 2020-12-09 Can a Public Blockchain Keep a Secret? in THEORY OF CRYPTOGRAPHY
  • 2019-11-22 On Fully Secure MPC with Solitary Output in THEORY OF CRYPTOGRAPHY
  • 2018-11-08 Best Possible Information-Theoretic MPC in THEORY OF CRYPTOGRAPHY
  • 2018-07-25 On the Local Leakage Resilience of Linear Secret Sharing Schemes in ADVANCES IN CRYPTOLOGY – CRYPTO 2018
  • 2018-02-05 Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting in JOURNAL OF CRYPTOLOGY
  • 2017-11-05 Secure Two-Party Computation with Fairness - A Necessary Design Principle in THEORY OF CRYPTOGRAPHY
  • 2017-07-29 Robust Non-interactive Multiparty Computation Against Constant-Size Collusion in ADVANCES IN CRYPTOLOGY – CRYPTO 2017
  • 2013 A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness in THEORY OF CRYPTOGRAPHY
  • 2012 Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting in TOPICS IN CRYPTOLOGY – CT-RSA 2012
  • 2011 Perfectly-Secure Multiplication for Any t < n/3 in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2010-10-04 Security for Signcryption: The Two-User Model in PRACTICAL SIGNCRYPTION
  • 2010-09-15 Secure Computation Without Authentication in JOURNAL OF CRYPTOLOGY
  • 2010 Secure Network Coding over the Integers in PUBLIC KEY CRYPTOGRAPHY – PKC 2010
  • 2010 Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2010
  • 2010 Designing a Side Channel Resistant Random Number Generator in SMART CARD RESEARCH AND ADVANCED APPLICATION
  • 2009 The Round Complexity of Verifiable Secret Sharing Revisited in ADVANCES IN CRYPTOLOGY - CRYPTO 2009
  • 2008 Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs in COMPUTER SECURITY - ESORICS 2008
  • 2008-01-01 Threshold RSA for Dynamic and Ad-Hoc Groups in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2008
  • 2008-01-01 Degradation and Amplification of Computational Hardness in THEORY OF CRYPTOGRAPHY
  • 2007-07 RSA-Based Undeniable Signatures in JOURNAL OF CRYPTOLOGY
  • 2007-07 Robust and Efficient Sharing of RSA Functions in JOURNAL OF CRYPTOLOGY
  • 2006-05-24 Secure Distributed Key Generation for Discrete-Log Based Cryptosystems in JOURNAL OF CRYPTOLOGY
  • 2005 Secure Computation Without Authentication in ADVANCES IN CRYPTOLOGY – CRYPTO 2005
  • 2004 Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering in THEORY OF CRYPTOGRAPHY
  • 2004 Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes in ADVANCES IN CRYPTOLOGY – CRYPTO 2004
  • 2004 Secure Hashed Diffie-Hellman over Non-DDH Groups in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004
  • 2003-02-28 Secure Applications of Pedersen’s Distributed Key Generation Protocol in TOPICS IN CRYPTOLOGY — CT-RSA 2003
  • 2003 Universal Composition with Joint State in ADVANCES IN CRYPTOLOGY - CRYPTO 2003
  • 2003 Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card in COMPUTER SECURITY – ESORICS 2003
  • 2002-09-13 On 2-Round Secure Multiparty Computation in ADVANCES IN CRYPTOLOGY — CRYPTO 2002
  • 2002-04-29 On the Security of Joint Signature and Encryption in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2002
  • 2001-04-02 Fair e-Lotteries and e-Casinos in TOPICS IN CRYPTOLOGY — CT-RSA 2001
  • 2000-08-11 A Cryptographic Solution to a Game Theoretic Problem in ADVANCES IN CRYPTOLOGY — CRYPTO 2000
  • 2000-03-21 RSA-Based Undeniable Signatures in JOURNAL OF CRYPTOLOGY
  • 2000-03 Robust and Efficient Sharing of RSA Functions in JOURNAL OF CRYPTOLOGY
  • 1999-12-16 Adaptive Security for Threshold Cryptosystems in ADVANCES IN CRYPTOLOGY — CRYPTO’ 99
  • 1999-04-15 Secure Hash-and-Sign Signatures Without the Random Oracle in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’99
  • 1999-04-15 Secure Distributed Key Generation for Discrete-Log Based Cryptosystems in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’99
  • 1999-04-15 Efficient Multiparty Computations Secure Against an Adaptive Adversary in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’99
  • 1998 A simplified approach to threshold and proactive RSA in ADVANCES IN CRYPTOLOGY — CRYPTO '98
  • 1998 Batch verification with applications to cryptography and checking in LATIN'98: THEORETICAL INFORMATICS
  • 1998 Fast batch verification for modular exponentiation and digital signatures in ADVANCES IN CRYPTOLOGY — EUROCRYPT'98
  • 1997 RSA-based undeniable signatures in ADVANCES IN CRYPTOLOGY — CRYPTO '97
  • 1997 Secure distributed storage and retrieval in DISTRIBUTED ALGORITHMS
  • 1996 Robust and Efficient Sharing of RSA Functions in ADVANCES IN CRYPTOLOGY — CRYPTO ’96
  • 1996 Robust Threshold DSS Signatures in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’96
  • 1991 Collective Coin Tossing Without Assumptions nor Broadcasting in ADVANCES IN CRYPTOLOGY-CRYPT0’ 90
  • 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.25879.31", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.481554.9", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.22448.38", 
            "type": "Organization"
          }
        ], 
        "familyName": "Rabin", 
        "givenName": "Tal", 
        "id": "sg:person.015473523512.58", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015473523512.58"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:56", 
        "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_686.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.015473523512.58'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...