Silvio Micali. Fair public-key cryptosystems. In Ernest Brickell, editor, Advances in Cryptology -- CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 113--128. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....should satisfy the property of k independence in the relationship graph for some integer k. Note that a k independent set is not necessarily an access structure though. Similarly, we may also conjecture that the k independent set problem will have some applications in key escrow protocols [17]. Note that at present, the number of trusted agencies in a key escrow system is very limited (e.g. 2 or 3) However, in the future there may be possibility that the number of trusted agencies will increase considerably. Whence the problem of choosing trusted agencies for the key escrow system ....

S. Micali. Fair public-key cryptosystem. In: Advances in Cryptology, Proc. of Crypto '92, LNCS 740, pages 113--138, Springer Verlag, 1992.

....employ (veri able) secret sharing techniques [Sha79,Fel87] General multi party computation [Yao82,GMW87] and research on practical fault tolerant distributed computation of various cryptographic functions [DF89] can also be instrumental in building ecient scalable solutions. Key escrow schemes [Mic92,KL95,YY98], blind signatures, anonymous credentials, and anonymous (or key private ) public key encryption are also closely related to Negotiated Privacy, but do not provide all the required properties [Cha82,KP98,Bra00,CL01,AR02,BBDP01] 4 Security Model We describe the basic research problem underlying ....

S. Micali. Fair public-key cryptosystems. In Proc. CRYPTO '92, volume 740 of LNCS, pages 113-138. Springer-Verlag, 1992.

....escrow. Finally we present some practical deniable decryption variants of popular public key systems. Key words: RIP, key escrow, key confiscation. 1 Introduction Key escrow was proposed as a mechanism to protect society from criminals who use encryption to block access to evidence of crime [3, 22, 9] (for a taxonomy of key escrow systems see [10] While the US key escrow proposal (EES) 9] was never approved, the British Regulations of Investigatory Powers (RIP) Act 2000 [25] has been enacted and is now law. The RIP act has been heavily criticized in the press and over the internet (see e.g. ....

.... shall not provide the basis for any motion to suppress or other objection to the introduction of electronic surveillance evidence lawfully acquired [11] It is no surprise therefore that alternative key escrow systems have been proposed to address, to a certain extent, this issue (see e.g. [22, 20, 17, 5, 1]) The strongest model proposed so far guarantees time limited decryption even when the escrow agencies are taken over unlawfully. For example, encrypted data (ciphertexts) of law abiding citizens in a democratic society is protected even if at a later date a dictatorship takes full control of ....

S. Micali. Fair public-key cryptosystems. In E. F. Brickell, editor, Advances in Cryptology --- Crypto '92, Proceedings, Lecture Notes in Computer Science 740, Springer 1993, 113--138

....of our protocol is that after setting up A to use the system, E is only involved when it is actually needed to determine A s identity. Keywords: Cryptography, Key escrow, Proofs of identity. 1 Introduction Key escrow has proven an active and contentious field of research and discussion (c.f. [20, 21, 18, 13, 15, 19, 22]) Essentially all of the attention in this area has been restricted to the simple case of communication: party A sends an encrypted message EK (M) to party B; some centralized authority is given the capability to recover either K or the specific message M . We consider a new domain for the ....

S. Micali. Fair public-key cryptosystems. Technical Report 579, MIT Lab. for Computer Science, September 1993. 17

....is reduced to two problems which are believed to be hard) Keywords Key escrow, auctions with closed bids, time stamps, complexity theory. I. Introduction Key escrow has been proposed as a mechanism to protect society from individuals who use a communication system for criminal purposes [1] [2], 3] an excellent survey of key escrow systems is given by D.E. Denning and D.K. Branstad in [4] However key escrow can also be used to target innocent individuals. This potential targeting is a major factor which contributes to the social unacceptability of key escrow. From the point of view ....

....key escrow may restrict his her privacy and give controlling power to society (Big Brother [7] which may, in certain circumstances, abuse it. In a society oriented key escrow system this power must be equally shared between the individual and society (for an analysis of fair cryptosystems see [2], 8] Furthermore it must have a limited life span (see e.g. 5] 6] Indeed a major objection to currently proposed key escrow schemes (e.g. the Clipper [3] is that there is no effective time control. Once an order to recover a key by the escrow agents has been given, there is nothing to ....

S. Micali, "Fair public-key cryptosystems," in Advances in Cryptology -- Crypto '92, Lecture Notes in Computer Science #740, E.F. Brickell, Ed., 1993, pp. 113--138, Springer-Verlag.

....number of other applications, for example parameter generation for Fiat Shamir signatures [10] also spring to mind. As an illustration of the potential application, suppose users of a system are required to escrow session keys for possible retrieval later by a duly authorised entity (see Micali [17]) Each time a session using key begins, the users deposit encrypted under the public RSA escrow key (N; e) as: e mod N : The key generation protocols we discuss can be used by two escrow agents to generate shares of this highly sensitive escrow key. Now users do not have to trust the ....

S. Micali. Fair public-key cryptosystems. In E.F. Brickell, editor, Advances in Cryptology -- CRYPTO `92, volume 740 of Lecture Notes in Computer Science, pages 113--138. SpringerVerlag. 1993.

....one for each application. We do not require the use of temper proof devices. Key Words: key escrow, auctions with closed bids, time stamps. 1 Introduction Key escrow has been proposed as a mechanism to protect society from individuals who use a communication system for criminal purposes [4, 24, 10] (an excellent survey of key escrow systems is given by D.E. Denning and D.K. Branstad in [11] However key escrow can also be used to target innocent individuals. This potential targeting is a major factor which contributes to the social unacceptability of key escrow. From the point of view of ....

....key escrow may restrict his her privacy and give controlling power to society (Big Brother [8] which may, in certain circumstances, abuse it. In a society oriented key escrow this power must be equally shared between the individual and society (for an analysis of fair cryptosystems see [24, 22]) Furthermore it must have a limited life span. Indeed a major objection to currently proposed key escrow schemes is that there is no effective time control. Once an order to recover a key by the escrow agents has been given, there is nothing to prevent the agents from abusing their power and ....

Micali, S.: Fair public-key cryptosystems. In: Brickell, E.F. (ed): Advances in Cryptology -- Crypto '92, Proceedings (Lecture Notes in Computer Science 740). Springer-Verlag (1993) 113--138

....activities. This essay is focused on the definitional and constructive activities mentioned above. Other activities in the foundations of cryptography include the exploration of new directions and the marking of limitations. For example, we mention novel modes of operation such as split entities [16, 45, 96], batching operations [55] off line on line signing [50] and Incremental Cryptography [6, 7] On the limitation side, we mention [84, 66] In particular, 84] indicates that certain tasks (e.g. secret key exchange) are unlikely to be achieved by using a one way function in a black box manner . ....

S. Micali. Fair Public-Key Cryptosystems. In Crypto92, Springer-Verlag Lecture Notes in Computer Science (Vol. 740), pages 113--138.

....This brief summary is focused on the definitional and constructive activities mentioned above. Other activities in the foundations of cryptography include the exploration of new directions and the marking of limitations. For example, we mention novel modes of operation such as split entities [5, 23], batching operations [11] off line on line signing [10] and Incremental Cryptography [1, 2] On the limitation side, we mention [20, 14] In particular, 20] indicates that 1 The only exception to the latter statement is Levin s observation regarding the existence of a universal one way ....

S. Micali. Fair Public-Key Cryptosystems. In Crypto92, Springer-Verlag LNCS (Vol. 740), pages 113--138.

....activities. This essay is focused on the definitional and constructive activities mentioned above. Other activities in the foundations of cryptography include the exploration of new directions and the marking of limitations. For example, we mention novel modes of operation such as split entities [17, 60, 131], batching operations [78] off line on line signing [69] and Incremental Cryptography [6, 7] On the limitation side, we mention [115, 95] In particular, 115] indicates that certain tasks (e.g. secret key exchange) are unlikely to be achieved by using a one way function in a black box ....

S. Micali. Fair Public-Key Cryptosystems. In Crypto92, Springer-Verlag Lecture Notes in Computer Science (Vol. 740), pages 113--138.

....because of its widespread use (a de facto standard) In addition, since in the RSA cryptosystem the signing algorithm coincides with the decryption algorithm, solutions to shared RSA signatures usually lead to shared RSA decryption procedures which have various applications, e. g key escrow (cf. [Mic92]) and secure distributed storage (cf. GGJR97] Desmedt and Frankel initiated the study of threshold RSA [DF91] which was followed by De Santis, Desmedt, Frankel, and Yung [DDFY94] These papers provide solutions for the problem of threshold RSA, however, they lack the robustness property. The ....

Silvio Micali. Fair public-key cryptosystems. In E. Brickell, editor, Advances in Cryptology | Crypto '92, pages 113-138, Berlin, 1992. Springer-Verlag. Lecture Notes in Computer Science No. 740. 30

....the keys on the Clipper chips are not generated in a sufficiently secure fashion; there will not be sufficient competition among implementers, resulting in expensive and slow chips; software implementations are not possible; and the key size is fixed and cannot be increased if necessary. Micali [55] has recently proposed an alternative system that also attempts to balance the privacy concerns of law abiding citizens with the investigative concerns of law enforcement agencies. Called fair public key cryptography, it is similar in function and purpose to the Clipper chip proposal but users can ....

S. Micali. Fair public-key cryptosystems. In Advances in Cryptology --- Crypto '92, Springer-Verlag, New York, 1993.

....This second tier is only accessible with the help of a third party, which is separate from (and not under the control of) the party managing access. We describe identity escrow schemes in Section 1.1 below. Key escrow has proven an active and contentious field of research and discussion (c.f. [24, 25, 22, 18, 21, 23, 27]) Most of the attention in this area has been restricted to the simple case of communication: party A sends an encrypted message EK (M) to party B; some centralized authority is given the capability to recover either K or the specific message M . As discussed in Section 3, group signatures has an ....

S. Micali. Fair public-key cryptosystems. Technical Report 579, MIT Lab. for Computer Science, September 1993.

....give the first simple and efficient zeroknowledge proof that a number N is the product of exactly two primes P and Q. General results on zero knowledge [5] could in principle be used for this task but they are beyond the relm of being practical. Previous attempts to solve this problem efficiently [6, 7] gave only partial solutions to this problem, stopping at proving that N was the product of two prime powers. An odd prime P = 2p 1 is called safe if p is prime. Safe primes are an important class of prime numbers useful in many cryptographic applications. For example, the use of safe primes has ....

S. Micali, "Fair Public-Key Cryptosystems," in Advances in Cryptology - CRYPTO '92, Lecture Notes in Computer Science 740, Springer-Verlag, 1993, pp. 113-138.

....outcry [11] partly from cryptologists opposed to the use of a secret al..gorithm, partly from rights advocates opposed to the whole idea of escrowed keys. The secret al..gorithm (SKIPJACK) is certainly unnecessary for an escrow system and excellent alternatives have been proposed, e.g. by Micali [8] and Kilian and Leighton [7] The escrow issue itself is more troublesome. As presently constituted, EES calls for individual keys to be split into the hands of two trustees (namely, NIST and a branch of the Treasury Department) who, when served with a lawful warrant, will turn the key over to ....

....We believe that a system in which the courts can enforce the terms of a warrant will not only help preserve privacy rights, but will also enable the courts to be more liberal in granting warrants so that federal and state authorities can make better use of electronic surveillance. Micali s system [8] already permits time bound warrants, for which the law enforcement authorities receive only keys good for the warrant period. We go a step further, allowing the trustees to supply authorities with a key good for only a pair of conversants, when appropriate. Thus, for example, if some set of ....

[Article contains additional citation context not shown here]

S. Micali, "Fair public key cryptosystems," Proc. Crypto'92.

....among the servers, so that t 1 servers can collectively decrypt messages encrypted under the corresponding public key or fully reconstruct the private key, but t or fewer cannot. Mathematically these protocols resemble several other escrow methods proposed in the scientific literature (e.g. [21, 8, 17]) though minor differences arise due to differences in goals and system constraints. There is also a body of more distantly related proposals for key escrow, including the EES program [22] which provides symmetric key escrow using very different mechanisms. We know of no efforts besides ....

S. Micali. Fair public-key cryptosystems. In E. F. Brickell, editor, Advances in Cryptology---Proceedings of CRYPTO '92 (Lecture Notes in Computer Science 740), pages 113-- 138. Springer-Verlag, 1992.

....Previous Work The general approach of distributing information to maintain privacy has been used in many situations, including the previous work on reading from a distributed database [CGKS 95, Amb 96, CG 97] the U. S. Government s Clipper Chip proposal [U.S. 93] Micali s fair cryptosystems [M 92], secretsharing schemes [S 79] and instance hiding schemes [RAD 78, AFK 89, BF 90, BFKL 90] Closely related to the private storage problem is the oblivious RAM simulation problem, studied in [G 87, Ost 90, GO 96] and indeed the techniques we employ here build on those used to solve the ....

S. Micali. Fair public-key cryptosystems. In Advances in Cryptology--- Proc. Crypto '92, pp. 113--138, 1992.

....be trustworthy, the suggestion to rely on several databases (or players) to achieve greater security has been suggested in many different settings, including previous work on reading from multiple databases of [CGKS 95] U.S. government Clipper chip proposal [U.S. 93] Micali s fair cryptosystems [M 92], secret sharing schemes [B 79, S 79] and instance hiding schemes of [RAD 78, AFK 89, BF 90, BFKL 90] The suggestion to rely on several, distributed agents is especially relevant due to the explosive growth of the internet and the advent of small, cheap network computers . In this scenario, ....

Micali, S. "Fair Public-Key Cryptosystems" Crypto 92, LNCS Vol 740, pp. 113-138.

No context found.

Silvio Micali. Fair public-key cryptosystems. In Ernest Brickell, editor, Advances in Cryptology -- CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 113--128. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1993.

No context found.

Micali, S.: Fair public-key cryptosystems. In Advances in Cryptology --- Crypto '92, Proceedings (Lecture Notes in Computer Science 740) (1993) E. F. Brickell, Ed. Springer-Verlag pp. 113--138

No context found.

S. Micali. Fair public-key cryptosystems. In Advances in Cryptology: Proceedings of CRYPTO '92 (E.F. Brickell, editor), pages 512-517. Springer-Verlag, Berlin, LCNS 740, 1992.

No context found.

S. Micali. Fair public-key cryptosystems. In Advances in Cryptology - Crypto '92, Springer-Verlag, NewYork, 1993.

No context found.

Micali, S. (1992) Fair public key cryptosystems. In Proc. Advances in Cryptology---CRYPTO '92, Santa Barbara, CA, August 16--20. Lecture Notes in Computer Science, 740, 113-- 138. Springer, Berlin.

No context found.

S. Micali. Fair public-key cryptosystems. In Advances in Cryptology - Crypto '92, Springer-Verlag, New York, 1993.

No context found.

Micali, Silvio, "Fair Public-Key Cryptosystems".

First 50 documents

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