A. Shamir, "How to Share a Secret," Comm. ACM, vol. 22, no. 11, pp. 612-613, Nov. 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Low-Cost and Reliable Mutual Anonymity - Protocols In Peer-To-Peer (Correct)
No context found.
A. Shamir, "How to Share a Secret," Comm. ACM, vol. 22, no. 11, pp. 612-613, Nov. 1979.
Distributed "Magic Ink" Signatures - Markus Jakobsson Moti (Correct)
No context found.
A. Shamir, "How to Share a Secret," CACM, V. 22, 1979, pp. 612-613.
Characterizing Ideal Weighted Threshold Secret - Sharing Amos Beimel (2005) (4 citations) (Correct)
No context found.
A. Shamir. How to share a secret. Communications of the ACM, 22:612--613, 1979.
Secure and Ecient Threshold Key Issuing Protocol for - Id-Based Cryptosystems Phani (2006) (Correct)
No context found.
A. Shamir, How to Share a Secret, Comm. ACM, vol.22(11), pp.612-613, 1979.
Rational Secret Sharing, Revisited - Dov Gordon Jonathan (2006) (Correct)
No context found.
A. Shamir. How to Share a Secret. Comm. ACM, 22(11): 612--613 (1979).
Monotone Circuits for Weighted Threshold Functions - Amos Beimel Enav (2004) (Correct)
No context found.
A. Shamir. How to share a secret. Communications of the ACM, 22:612--613, 1979.
Verifiably Encrypted Signature Scheme with Threshold - Adjudication Choudary Gorantla (2006) (Correct)
No context found.
Shamir, A.: How to share a secret. Communications of the ACM. 22(11). ACM Press. (1979) 612-613
Attribute-Based Encryption for - Fine-Grained Access Control (2006) (Correct)
No context found.
A. Shamir. How to share a secret. Commun. ACM, 22(11):612--613, 1979.
Authentication in a Reconfigurable Byzantine - Fault Tolerant System (Correct)
No context found.
Adi Shamir. How to share a secret. Commun. ACM, 22 (11):612--613, 1979.
ExchangeGuard: A Distributed Protocol for Electronic.. - Mudhakar Srivatsa Li (Correct)
No context found.
A. Shamir. How to share a secret. In Communications of ACM, 1979.
Ideal Multipartite Secret Sharing Schemes - Oriol Farras Jaume (2006) (Correct)
No context found.
A. Shamir. How to share a secret. Commun. of the ACM , 22 (1979) pp. 612--613.
General Secret Sharing Based on the Chinese - Remainder Theorem Sorin (2006) (Correct)
No context found.
A. Shamir. How to share a secret. Communications of the ACM, 22(11):612--613, 1979. 15
Threshold Ring Signatures in the Random Oracle Model - Exte Nd Ed (Correct)
No context found.
Shamir, A. How to share a secret. Commun. ACM 22, 11 (1979), 612--613. 8
Verifiable Secret Redistribution - Theodore Wong Jeannette (Correct)
No context found.
A. Shamir. How to share a secret. Communications of the ACM, 22(11):612--613, November 1979.
Secure Routing In Ad Hoc Networks And A Related Intrusion - Detection Problem Wensheng (Correct)
No context found.
A. Shamir, "How to Share a Secret," Communications of the ACM, vol. 22, no. 11, pp. 612--613, 1979.
Toward Econometric Models of the Security Risk from Remote Attacks - Schechter (2004) (Correct)
No context found.
Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612--613, November 1979.
Secure Distributed Data-Mining and Its Application to.. - Roughan, Zhang (2006) (Correct)
No context found.
A. Shamir. How to share a secret. Communications of the ACM, 22(11):612--613, 1979.
An Efficient Authenticated Asymmetric Key Exchange Scheme - Chakraborty, Nandi (2000) (Correct)
No context found.
A Shamir, "How to Share a Secret", Communications of the ACM, Vol. No. 22, pp. 612-613, 1979.
On Ideal Non-Perfect Secret Sharing Schemes - Published In Christianson (Correct)
No context found.
A. Shamir, How to share a secret, Communications of the ACM, vol. 22, n.11, pp. 612--613, Nov. 1979.
Constant-Round Multiparty Computation Using a Black-Box.. - Damgård, Ishai (2005) (Correct)
No context found.
A. Shamir. How to share a secret. Commun. ACM, 22(6):612--613, June 1979.
New Results on Multipartite Access Structures - Javier Herranz And (2006) (1 citation) (Correct)
No context found.
A. Shamir. How to share a secret. Communications of the ACM, 22, pp. 612-613 (1979).
Two-Party Private Vector Dominance: The All-Or-Nothing Deal - Maged Hamada Ibrahim (Correct)
No context found.
A. Shamir, "How to share a secret," Comm. ACM, 22(11), 1979, pp. 612--613,
A Broadcast Encryption Scheme with Free-Riders but.. - Adelsbach, Greveler (2005) (Correct)
No context found.
Shamir, A.: How to share a secret. Commun. ACM 22(11) (1979) 612--613
Representing Small Identically Self-Dual Matroids By - Self-Dual Codes Carles (2005) (Correct)
No context found.
A. Shamir. How to share a secret. Commun. of the ACM. 22 (1979) 612--613.
On Secret Sharing Schemes, Matroids and Polymatroids - Jaume Mart-Farre And (2006) (Correct)
No context found.
A. Shamir. How to share a secret. Commun. of the ACM , 22 (1979) pp. 612--613.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC