Tal Rabin

Orcid: 0000-0003-1386-605X

Affiliations:
  • University of Pennsylvania, Philadelphia, PA, USA
  • IBM Research (former)


According to our database1, Tal Rabin authored at least 82 papers between 1989 and 2025.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2017, "For contributions to foundations of cryptography, including multi-party computations, signatures, and threshold and proactive protocol design".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Encrypted Matrix-Vector Products from Secret Dual Codes.
IACR Cryptol. ePrint Arch., 2025

Gold OPRF: Post-Quantum Oblivious Power-Residue PRF.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

2024
SPRINT: High-Throughput Robust Distributed Schnorr Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Analyzing the Real-World Security of the Algorand Blockchain.
IACR Cryptol. ePrint Arch., 2023

Proactive Secret Sharing with Constant Communication.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

Additive Randomized Encodings and Their Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Analyzing the Real-World Security of the Algorand Blockchain.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Incremental Offline/Online PIR.
Proceedings of the 31st USENIX Security Symposium, 2022

Threshold Cryptography as a Service (in the Multiserver and YOSO Models).
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

New Multiparty Computational Model: From Nakamoto to YOSO.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning.
Proc. Priv. Enhancing Technol., 2021

Incremental Offline/Online PIR (extended version).
IACR Cryptol. ePrint Arch., 2021

Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC.
IACR Cryptol. ePrint Arch., 2021

YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Can a Blockchain Keep a Secret?
IACR Cryptol. ePrint Arch., 2020

Can a Public Blockchain Keep a Secret?
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Cryptography for #MeToo.
Proceedings of the 25th ACM Symposium on Access Control Models and Technologies, 2020

2019
Cryptography for #MeToo.
Proc. Priv. Enhancing Technol., 2019

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
J. Cryptol., 2019

On Fully Secure MPC with Solitary Output.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

2018
Best Possible Information-Theoretic MPC.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

On the Local Leakage Resilience of Linear Secret Sharing Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Privacy-Preserving Search of Similar Patients in Genomic Data.
IACR Cryptol. ePrint Arch., 2017

Secure Two-Party Computation with Fairness - A Necessary Design Principle.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Robust Non-interactive Multiparty Computation Against Constant-Size Collusion.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Public-Key Cryptography (Dagstuhl Seminar 16371).
Dagstuhl Reports, 2016

Towards a Privacy Research Roadmap for the Computing Community.
CoRR, 2016

Secure Multiparty Computation with General Interaction Patterns.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Attribute-based Key Exchange with General Policies.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2014
Protecting Circuits from Computationally Bounded and Noisy Leakage.
SIAM J. Comput., 2014

2013
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

2011
Perfectly-Secure Multiplication for Any <i>t < n</i>/3.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Security for Signcryption: The Two-User Model.
Proceedings of the Practical Signcryption, 2010

Secure Network Coding over the Integers.
Proceedings of the Public Key Cryptography, 2010

Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Designing a Side Channel Resistant Random Number Generator.
Proceedings of the Smart Card Research and Advanced Application, 2010

Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
On Compression of Data Encrypted with Block Ciphers.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

The Round Complexity of Verifiable Secret Sharing Revisited.
Proceedings of the Advances in Cryptology, 2009

2008
Degradation and Amplification of Computational Hardness.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Threshold RSA for Dynamic and Ad-Hoc Groups.
Proceedings of the Advances in Cryptology, 2008

Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs.
Proceedings of the Computer Security, 2008

2006
Information-theoretically secure protocols and security under composition.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
Secure Computation Without Authentication.
Proceedings of the Advances in Cryptology, 2005

2004
Protocol Initialization for the Framework of Universal Composability.
IACR Cryptol. ePrint Arch., 2004

Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Secure Hashed Diffie-Hellman over Non-DDH Groups.
Proceedings of the Advances in Cryptology, 2004

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes.
Proceedings of the Advances in Cryptology, 2004

2003
Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card.
Proceedings of the Computer Security, 2003

Secure Applications of Pedersen's Distributed Key Generation Protocol.
Proceedings of the Topics in Cryptology, 2003

Universal Composition with Joint State.
Proceedings of the Advances in Cryptology, 2003

2002
On the composition of authenticated byzantine agreement.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Sequential composition of protocols without simultaneous termination.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

On the Security of Joint Signature and Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

On 2-Round Secure Multiparty Computation.
Proceedings of the Advances in Cryptology, 2002

2001
The round complexity of verifiable secret sharing and secure multicast.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Fair e-Lotteries and e-Casinos.
Proceedings of the Topics in Cryptology, 2001

2000
Chameleon Signatures.
Proceedings of the Network and Distributed System Security Symposium, 2000

A Cryptographic Solution to a Game Theoretic Problem.
Proceedings of the Advances in Cryptology, 2000

1999
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems.
Proceedings of the Advances in Cryptology, 1999

Secure Hash-and-Sign Signatures Without the Random Oracle.
Proceedings of the Advances in Cryptology, 1999

Efficient Multiparty Computations Secure Against an Adaptive Adversary.
Proceedings of the Advances in Cryptology, 1999

Adaptive Security for Threshold Cryptosystems.
Proceedings of the Advances in Cryptology, 1999

1998
Chameleon Hashing and Signatures.
IACR Cryptol. ePrint Arch., 1998

Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Batch Verification with Applications to Cryptography and Checking.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Fast Batch Verification for Modular Exponentiation and Digital Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

A Simplified Approach to Threshold and Proactive RSA.
Proceedings of the Advances in Cryptology, 1998

An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
Proceedings of the CCS '98, 1998

1997
Secure Distributed Storage and Retrieval.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

RSA-Based Undeniable Signatures.
Proceedings of the Advances in Cryptology, 1997

1996
Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Robust Threshold DSS Signatures.
Proceedings of the Advances in Cryptology, 1996

Robust and Efficient Sharing of RSA Functions.
Proceedings of the Advances in Cryptology, 1996

1994
Optimal secrecy and resilience for asynchronous distributed computations (בטיחות ועמידות אופטימליים עבור חשובים מבזרים אסינכרוניים.).
PhD thesis, 1994

Robust Sharing of Secrets When the Dealer is Honest or Cheating.
J. ACM, 1994

Asynchronous Secure Computations with Optimal Resilience (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Fast asynchronous Byzantine agreement with optimal resilience.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1990
Collective Coin Tossing Without Assumptions nor Broadcasting.
Proceedings of the Advances in Cryptology, 1990

1989
Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989


  Loading...