Proceedings Article10.1145/195058.195405
How to share a function securely
Alfredo De Santis,Yvo Desmedt,Yair Frankel,Moti Yung +3 more
- 23 May 1994
- pp 522-533
381
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Practical threshold signatures
Victor Shoup
- 14 May 2000
TL;DR: The RSA threshold signature scheme presented in this article is robust and unforgeable in the random oracle model, assuming the RSA problem is hard, and the signature share generation and verification is completely non-interactive.
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Amir Herzberg,Stanislaw Jarecki,Stanislaw Jarecki,Hugo Krawczyk,Moti Yung +4 more
- 27 Aug 1995
TL;DR: In order to guarantee the availability and integrity of the secret, this work provides mechanisms to detect maliciously (or accidentally) corrupted shares, as well as mechanisms to secretly recover the correct shares when modification is detected.
Oblivious transfer and polynomial evaluation
Moni Naor,Benny Pinkas +1 more
- 01 May 1999
TL;DR: The efficiency of the new OT protocols makes them useful for a variety of applications, including oblivious sampling which can be used to securely compare the sizes of web search engines, protocols for privately solving the list intersection problem and for mutually authenticated key exchange based on (possibly weak) passwords, and protocols for anonymity preserving web usage metering.
765
Number-theoretic constructions of efficient pseudo-random functions
Moni Naor,Omer Reingold +1 more
- 19 Oct 1997
TL;DR: A new construction of pseudo-random functions such that computing their value at any given point involves two multiple products, much more efficient than previous proposals.
710
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Rosario Gennaro,Michael O. Rabin,Tal Rabin +2 more
- 01 Jun 1998
TL;DR: 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.
600
References
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
A public key cryptosystem and a signature scheme based on discrete logarithms
Taher Elgamal
- 23 Aug 1985
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
A Method for Obtaining Digital Signatures and Public Key Cryptosystems (Formerly on Digital Signatures and Public Key Cryptosystems)
Ronald L. Rivest,Adi Shamir,Len Adelman +2 more
- 01 Jan 1977
TL;DR: In this paper, a message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q.
8.2K