Tal Rabin

According to our database1, Tal Rabin authored at least 99 papers between 1989 and 2019.

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 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Cryptography for #MeToo.
PoPETs, 2019

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

On Fully Secure MPC with Solitary Output.
IACR Cryptology ePrint Archive, 2019

On the Local Leakage Resilience of Linear Secret Sharing Schemes.
IACR Cryptology ePrint Archive, 2019

2018
Privacy-Preserving Search of Similar Patients in Genomic Data.
PoPETs, 2018

Best Possible Information-Theoretic MPC.
IACR Cryptology ePrint Archive, 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
Secure Two-Party Computation with Fairness - A Necessary Design Principle.
IACR Cryptology ePrint Archive, 2017

Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion.
IACR Cryptology ePrint Archive, 2017

Privacy-Preserving Search of Similar Patients in Genomic Data.
IACR Cryptology ePrint Archive, 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
Attribute-based Key Exchange with General Policies.
IACR Cryptology ePrint Archive, 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

2015
Secure Multiparty Computation with General Interaction Patterns.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 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
On Compression of Data Encrypted With Block Ciphers.
IEEE Trans. Information Theory, 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
Secure Computation Without Authentication.
J. Cryptology, 2011

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
IACR Cryptology ePrint Archive, 2011

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

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

Information-Theoretically Secure Protocols and Security under Composition.
SIAM J. Comput., 2010

On Compression of Data Encrypted with Block Ciphers.
IACR Cryptology ePrint Archive, 2010

Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead.
IACR Cryptology ePrint Archive, 2010

On Compression of Data Encrypted with Block Ciphers
CoRR, 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
Information-Theoretically Secure Protocols and Security Under Composition.
IACR Cryptology ePrint Archive, 2009

Secure Network Coding Over the Integers.
IACR Cryptology ePrint Archive, 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
The Round Complexity of Verifiable Secret Sharing Revisited.
IACR Cryptology ePrint Archive, 2008

Degradation and Amplification of Computational Hardness.
IACR Cryptology ePrint Archive, 2008

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

Threshold RSA for Dynamic and Ad-Hoc Groups.
IACR Cryptology ePrint Archive, 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

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

Secure Computation Without Authentication.
IACR Cryptology ePrint Archive, 2007

2006
On the composition of authenticated Byzantine Agreement.
J. ACM, 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
On the Composition of Authenticated Byzantine Agreement.
IACR Cryptology ePrint Archive, 2004

Secure Hashed Diffie-Hellman over Non-DDH Groups.
IACR Cryptology ePrint Archive, 2004

Protocol Initialization for the Framework of Universal Composability.
IACR Cryptology ePrint Archive, 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
Universal Composition with Joint State.
IACR Cryptology ePrint Archive, 2002

On the Security of Joint Signature and Encryption.
IACR Cryptology ePrint Archive, 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
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

RSA-Based Undeniable Signatures.
J. Cryptology, 2000

Robust and Efficient Sharing of RSA Functions.
J. Cryptology, 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 Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 1998

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

Secure Distributed Storage and Retrieval.
IACR Cryptology ePrint Archive, 1998

Fast Batch Verification for Modular Exponentiation and Digital Signatures.
IACR Cryptology ePrint Archive, 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
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...