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 80 papers between 1989 and 2023.

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

2023
Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning.
IACR Cryptol. ePrint Arch., 2023

Additive Randomized Encodings and Their Applications.
IACR Cryptol. ePrint Arch., 2023

Proactive Secret Sharing with Constant Communication.
IACR Cryptol. ePrint Arch., 2023

SPRINT: High-Throughput Robust Distributed Schnorr Signatures.
IACR Cryptol. ePrint Arch., 2023

Analyzing the Real-World Security of the Algorand Blockchain.
IACR Cryptol. ePrint Arch., 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

Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC.
Proc. Priv. Enhancing Technol., 2021

On the Local Leakage Resilience of Linear Secret Sharing Schemes.
J. Cryptol., 2021

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

YOSO: You Only Speak Once / Secure MPC with Stateless Ephemeral Roles.
IACR Cryptol. ePrint Arch., 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.
IACR Cryptol. ePrint Arch., 2019

2018
Privacy-Preserving Search of Similar Patients in Genomic Data.
Proc. Priv. Enhancing Technol., 2018

Best Possible Information-Theoretic MPC.
IACR Cryptol. ePrint Arch., 2018

2017
Secure Two-Party Computation with Fairness - A Necessary Design Principle.
IACR Cryptol. ePrint Arch., 2017

Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion.
IACR Cryptol. ePrint Arch., 2017

2016
Attribute-based Key Exchange with General Policies.
IACR Cryptol. ePrint Arch., 2016

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

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

2015
Secure Multiparty Computation with General Interaction Patterns.
IACR Cryptol. ePrint Arch., 2015

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

2013
Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.
IACR Cryptol. ePrint Arch., 2013

2012
On Compression of Data Encrypted With Block Ciphers.
IEEE Trans. Inf. Theory, 2012

2011
Secure Computation Without Authentication.
J. Cryptol., 2011

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
IACR Cryptol. ePrint Arch., 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

Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead.
IACR Cryptol. ePrint Arch., 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

2009
Information-Theoretically Secure Protocols and Security Under Composition.
IACR Cryptol. ePrint Arch., 2009

Secure Network Coding Over the Integers.
IACR Cryptol. ePrint Arch., 2009

2008
The Round Complexity of Verifiable Secret Sharing Revisited.
IACR Cryptol. ePrint Arch., 2008

Degradation and Amplification of Computational Hardness.
IACR Cryptol. ePrint Arch., 2008

Strongly-Resilient and Non-Interactive Hierarchical Key-Agreement in MANETs.
IACR Cryptol. ePrint Arch., 2008

Threshold RSA for Dynamic and Ad-Hoc Groups.
IACR Cryptol. ePrint Arch., 2008

2007
RSA-Based Undeniable Signatures.
J. Cryptol., 2007

Robust and Efficient Sharing of RSA Functions.
J. Cryptol., 2007

Secure Distributed Key Generation for Discrete-Log Based Cryptosystems.
J. Cryptol., 2007

2006
On the composition of authenticated Byzantine Agreement.
J. ACM, 2006

2004
Secure Hashed Diffie-Hellman over Non-DDH Groups.
IACR Cryptol. ePrint Arch., 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

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

2002
Universal Composition with Joint State.
IACR Cryptol. ePrint Arch., 2002

On the Security of Joint Signature and Encryption.
IACR Cryptol. ePrint Arch., 2002

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

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

2001
Robust Threshold DSS Signatures.
Inf. Comput., 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
Secure distributed storage and retrieval.
Theor. Comput. Sci., 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 Hash-and-Sign Signatures without the Random Oracle.
IACR Cryptol. ePrint Arch., 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

An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
IACR Cryptol. ePrint Arch., 1998

Fast Batch Verification for Modular Exponentiation and Digital 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

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

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

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...