C. S. Laih and L. Harn, "Generalized threshold cryptosystems," Advances in Cryptology: Proc. of AsiaCrypt'91, pp. 159-169, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....which later made public. Instead of a single signer, several multisignature schemes [6, 12] have been proposed in a distributed environment, where several signers work together to sign a document. In [16] Shamir proposed the concept of threshold schemes. Since then, many threshold cryptosystems [4, 10, 14] have been proposed. The scheme proposed in [14] allows n participants in a group cooperating to generate a group public key and to distribute a shared secret without the assistance of a mutually trusted authority. Anyone can send a message secretly to the group by encrypting the message using the ....

C. S. Laih and L. Harn, "Generalized threshold cryptosystems," Advances in Cryptology: Proc. of AsiaCrypt'91, pp. 159-169, 1991.

....like Kerberos be replicated: his techniques have a very weak dependency on time. Process group technologies permit Reiter to propose a number of exotic new security options as well. Still working with Horus, he explored the use of split secret mechanisms to ensure that in a group of n processes [HT87, Des88, Fra89, LH91, DFY92, FD92], the availability of any n k members would suffice to maintain secure and available access to that group. In this work, Reiter uses a state machine approach: the individual members have identical states and respond to incoming requests in identical manner. Accordingly, his focus was on ....

....Readings On Kerberos: SNS88, Sch94] Associated theory [LABW92, BM90] RSA and DES: DH79, RSA78, DES88, Den84] Fortezza: most information is online, but [Den96] includes a brief review. Rampart: RBG92, RBR95, Rei93, Rei94a, Rei94b] Split key cryptographic techniques and associated theory: [HT87, Des88, Fra89, LH91, DFY92, FD92]. Mixing techniques [Cha81, Coo94, CB95] Kenneth P. Birman Building Secure and Reliable Network Applications 384 384 20. Clock Synchronization and Synchronous Systems Previous sections of this book have made a number of uses of clocks or time in distributed protocols. In this chapter, we ....

C. S. Laih and L. Harn. Generalized Threshold Cryptosystems. In Proceedings of ASIACRYPT `91. 1991.

....shares for all Diffie Hellman keys in the list representing the group public key. A more serious problem is that the group cannot determine its internal policy itself, because the threshold level is always imposed by the sender. 1.5. 7 Threshold cryptosystem with general access structure In [106] Laih und Harn proposed a generalized threshold cryptosystem. This generalization means that it is possible to enable access to any combination of subsets of members. These subsets can be of various cardinality, unlike a k out of m threshold cryptosystem, in which all subsets are of fixed ....

....subsets are of fixed cardinality k. The number of subsets of shareholders in the access structure is arbitrary as well, while in a k out of m threshold cryptosystem all subsets with k members are allowed. An access structure within the group can be represented by the disjunctive normal form (DNF) [106]: Group Oriented Cryptosystems 33 Figure 1.3: Group cryptosystem with authorized members 34 F = f 1 f 2 Delta Delta Delta f t (1:27) where each f i is an access instance. For example, if in a group of four users (A,B,C and D) it must be possible to decrypt a ciphertext by either (A ....

[Article contains additional citation context not shown here]

Laih, C.S., Harn, L., Generalized Threshold Cryptosystems, Proceedings od ASIACRYPT 91, Springer Verlag, 159--166, 1992

....guarantees regarding the results of such communication. Another impetus to preserve process group abstractions in hostile environments is that the cryptographic community has identified several practical security needs in settings where groups occur naturally [7] Proposed solutions (e.g. [10, 15, 8]) however, presuppose a group oriented infrastructure which cannot be effectively provided in a hostile environment by current systems. Secure group oriented foundations will enable applications to more easily realize the benefits of this research. This paper presents a distributed security ....

Laih, C. S., and Harn, L. Generalized threshold cryptosystems. In Proceedings of ASIACRYPT '91 (Nov. 1991).

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