Tal Rabin | Academic Influence

Tal Rabin's AcademicInfluence.com Rankings

Tal Rabin

Computer Science

#2492

World Rank

#2602

Historical Rank

Database

#8169

World Rank

#8518

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Tal Rabin's Degrees

Masters Computer Science Weizmann Institute of Science

Similar Degrees You Can Earn

Best Online Master's in Computer Science

Why Is Tal Rabin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Tal Rabin is a computer scientist and Professor of Computer and Information Science at the University of Pennsylvania. She was previously the head of research at the Algorand Foundation and the head of the cryptography research group at IBM's Thomas J. Watson Research Center.

(See a Problem?)

Tal Rabin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Verifiable secret sharing and multiparty protocols with honest majority (1989) (1052)
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems (1999) (733)
On the Security of Joint Signature and Encryption (2002) (600)
Robust Threshold DSS Signatures (1996) (541)
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography (1998) (492)
Fast Batch Verification for Modular Exponentiation and Digital Signatures (1998) (461)
Secure Hash-and-Sign Signatures Without the Random Oracle (1999) (379)
Chameleon Signatures (2000) (331)
Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings (2010) (319)
Fast asynchronous Byzantine agreement with optimal resilience (1993) (297)
A Simplified Approach to Threshold and Proactive RSA (1998) (283)
Universal Composition with Joint State (2003) (271)
Efficient Multiparty Computations Secure Against an Adaptive Adversary (1999) (231)
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering (2004) (218)
Robust and Efficient Sharing of RSA Functions (2000) (193)
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes (2004) (185)
Asynchronous secure computations with optimal resilience (extended abstract) (1994) (184)
Secure Network Coding Over the Integers (2010) (174)
Adaptive Security for Threshold Cryptosystems (1999) (172)
A Cryptographic Solution to a Game Theoretic Problem (2000) (161)
Chameleon Hashing and Signatures (1998) (158)
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases (2010) (147)
The round complexity of verifiable secret sharing and secure multicast (2001) (142)
RSA-Based Undeniable Signatures (1997) (134)
Secure distributed storage and retrieval (1997) (128)
Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning (2020) (124)
Secure Computation Without Authentication (2005) (119)
Information-theoretically secure protocols and security under composition (2006) (117)
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012) (104)
Robust sharing of secrets when the dealer is honest or cheating (1994) (103)
On the composition of authenticated byzantine agreement (2002) (90)
On Compression of Data Encrypted With Block Ciphers (2009) (88)
Secure Hashed Diffie-Hellman over Non-DDH Groups (2004) (67)
An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products (1998) (67)
The Round Complexity of Verifiable Secret Sharing Revisited (2009) (62)
Secure Applications of Pedersen's Distributed Key Generation Protocol (2003) (60)
On 2-Round Secure Multiparty Computation (2002) (59)
Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs (2008) (59)
On the Local Leakage Resilience of Linear Secret Sharing Schemes (2018) (48)
Privacy-Preserving Search of Similar Patients in Genomic Data (2018) (47)
Algorithmic Game Theory: Cryptography and Game Theory (2007) (47)
Batch Verification with Applications to Cryptography and Checking (1998) (44)
Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead (2010) (44)
Robust and Efficient Sharing of RSA Functions (1996) (43)
Can a Public Blockchain Keep a Secret? (2020) (43)
Threshold RSA for Dynamic and Ad-Hoc Groups (2008) (40)
Protocol Initialization for the Framework of Universal Composability (2004) (37)
Efficient Multiparty Computations with Dishonest Minority (1998) (35)
Secure Multiparty Computation with General Interaction Patterns (2016) (34)
Sequential composition of protocols without simultaneous termination (2002) (28)
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness (2013) (25)
Fair e-Lotteries and e-Casinos (2001) (24)
YOSO: You Only Speak Once / Secure MPC with Stateless Ephemeral Roles (2021) (22)
Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card (2003) (22)
On the composition of authenticated Byzantine Agreement (2006) (21)
Perfectly-Secure Multiplication for Any t < n/3 (2011) (19)
Degradation and Amplification of Computational Hardness (2008) (18)
Collective Coin Tossing Without Assumptions nor Broadcasting (1990) (17)
Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion (2017) (16)
Towards a Privacy Research Roadmap for the Computing Community (2016) (15)
Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing (1996) (14)
1 Cryptography and Game Theory (14)
RSA-Based Undeniable Signatures (2015) (14)
Attribute-based Key Exchange with General Policies (2016) (13)
Protecting Circuits from Computationally Bounded and Noisy Leakage (2014) (13)
Designing a Side Channel Resistant Random Number Generator (2010) (13)
Cryptography for #MeToo (2019) (12)
Best Possible Information-Theoretic MPC (2018) (11)
Secure Two-Party Computation with Fairness - A Necessary Design Principle (2017) (6)
Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC (2021) (6)
Can a Blockchain Keep a Secret? (2020) (6)
Proceedings of the Third conference on Theory of Cryptography (2006) (5)
On Fully Secure MPC with Solitary Output (2019) (5)
Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings (2011) (3)
Proceedings of the 30th annual conference on Advances in cryptology (2010) (3)
Incremental Offline/Online PIR (extended version) (2021) (3)
Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (3)
Robust Threshold DSS Signatures CURRENT JOURNAL SUBMISSION VERSION , NEEDS SOME MINOR CORRECTIONS : DO NOT DISTRIBUTE ∗ (1999) (3)
Security for Signcryption: The Two-User Model (2010) (3)
Threshold Cryptography as a Service (in the Multiserver and YOSO Models) (2022) (2)
Theo ry of Cryptography (vol. # 3876) : Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings (2006) (1)
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2018) (0)
SPRINT: High-Throughput Robust Distributed Schnorr Signatures (2023) (0)
New Multiparty Computational Model: From Nakamoto to YOSO (2022) (0)
Advanced Homomorphic Encryption its Applications and Derivatives (AHEAD) (2013) (0)
Erratum to: Theory of Cryptography (2006) (0)
Chapter 2 Security for Signcryption : The Two-User Model (2010) (0)
Optimal secrecy and resilience for asynchronous distributed computations (בטיחות ועמידות אופטימליים עבור חשובים מבזרים אסינכרוניים.) (1994) (0)
Abstracts of the Data Management Group (2005) (0)
Public-Key Cryptography (Dagstuhl Seminar 16371) (2016) (0)

This paper list is powered by the following services:

Other Resources About Tal Rabin

en.wikipedia.org

What Schools Are Affiliated With Tal Rabin?

Tal Rabin is affiliated with the following schools:

Image Attributions

Image Source for Tal Rabin