T. Rabin

Publications95
h-index43
Citations9,703
Highly Influential Citations793
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • H. Krawczyk
  • 161 Publications • 25,348 Citations
  • Y. Ishai
  • 250 Publications • 13,794 Citations
  • Yehuda Lindell
  • 195 Publications • 18,267 Citations
  • I. Damgård
  • 321 Publications • 22,657 Citations
  • Publications
  • Influence
Verifiable secret sharing and multiparty protocols with honest majority
TLDR
A verifiable secret sharing protocol is presented, and it is shown that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest.
View on ACM
On the Security of Joint Signature and Encryption
TLDR
It is shown that gCCA2-security suffices for all known uses of CCA2-secure encryption, while no longer suffering from the definitional shortcomings of the latter.
View via Publisher
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
TLDR
This paper shows that a widely used dlog-based DKG protocol suggested by Pedersen does not guarantee a uniformly random distribution of generated keys, and presents a new protocol which proves to satisfy the security requirements from DKG protocols and ensures a uniform distribution of the generated keys.
View on Springer
Fast Batch Verification for Modular Exponentiation and Digital Signatures
TLDR
This work would like to do verification of a basic operation like modular exponentiation in some group by re-computing gx and checking that gx = y, and faster.
View via Publisher
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
TLDR
A very simple Verifiable Secret Sharing protocol is presented which is based on fast cryptographic primitives and avoids altogether the need for expensive zero-knowledge proofs and a highly simplified protocol to compute multiplications over shared secrets.
View on ACM
Fast asynchronous Byzantine agreement with optimal resilience
TLDR
Fast Asynchronous Byzantine Agreement with Optimal Resilience is presented, which aims to establish a consensus on the best approach to solve the problem of asynchronous Byzantine communications in the EMM domain.
View on ACM
Secure Hash-and-Sign Signatures Without the Random Oracle
TLDR
A new signature scheme is presented which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture, and is unique in that the assumptions made on the cryptographic hash function in use are well defined and reasonable.
View via Publisher
Chameleon Signatures
View Paper
Chameleon Hashing and Signatures
We introduce chameleon signatures that provide with an undeniable commitment of the signer to the contents of the signed document (as regular digital signatures do) but, at the same time, do not…
View Paper
Robust Threshold DSS Signatures
TLDR
This work presents threshold DSS (digital signature standard) signatures where the power to sign is shared by n players such that for a given parameter t there is a consensus that n players should have the right to sign.
View via Publisher
...
...