Divertible protocols and atomic proxy cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1403, Issue , 1998, Pages 127-144

  Blaze, Matt ^a   Bleumer, Gerrit ^a   Strauss, Martin ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; AUTHENTICATION; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

BLIND SIGNATURES; DIFFIE-HELLMAN KEY EXCHANGE; LANGUAGE PROPERTY; PROXY CRYPTOGRAPHY; PUBLIC KEY CRYPTOSYSTEMS; SEVERAL PROTOCOLS; SIGNATURE SCHEME; ZERO KNOWLEDGE PROOF;

CRYPTOGRAPHY;

EID: 84957718934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054122     Document Type: Conference Paper

References (21)

1. [BS98] Matt Blaze, Martin Strauss. Atomic Proxy Cryptography. AT and T Labs-Research TR98.5.1
2. [Bleu97] Gerrit Bleumer. On Protocol Divertibility. AT and T Labs-Research TR97.34.2
3. [BD91] Mike V. D. Burmester, Yvo Desmedt. All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions. Eurocrypt ’90 LNCS 473, Springer-Verlag 1991, 1-10.
4. [CEG88] David Chaum, Jan-Hendrik Evertse, Jeroen van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. Eurocrypt ’87. LNCS 304, Springer-Verlag 1988, 127-141.
5. [CPS95] Jan L. Camenisch, Jean-Marc Piveteau, Markus A. Stadler. Blind Signatures Based on the Discrete Logarithm Problem. Eurocrypt ’94. LNCS 950, Springer-Verlag 1995, 428-432.
6. [DeL84] John M. DeLaurentis. A Further Weakness in the Common Modulus Protocol for the RSA Cryptoalgorithm. Cryptologia 8/3 (1984) 253-259.
7. [DH76] Whitfield Diffie, Martin E. Heilman. New Directions in Cryptography. IEEE Transactions on Information Theory. 22/6 (1976) 644-654.
8. [E1G85] Taher ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory. 31/4 (1985) 469-472.
9. [FFS88] Uriel Feige, Amos Fiat, Adi Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology 1/2 (1988) 77-94.
10. [FS87] Amos Fiat, Adi Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. Crypto ’86. LNCS 263, Springer-Verlag 1987, 186-194.
11. [GMR89] Shafi Goldwasser, Silvio Micali, Charles Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Computing. 18/1 (1989) 186-207.
12. [HMP95] Patrick Horster, Markus Michels, Holger Petersen. Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications. Asiacrypt ’94. LNCS 917, Springer-Verlag 1995, 224-237.
13. [Hug94] Eric Hughes. An encrypted key transmission protocol. Crypto ’94 Rump Session presentation, August 1994.
14. [ISS91] Toshija Itoh, Kouichi Sakurai, Hiroki Shizuya. Any Language in IP has a Divertible ZKIP. AsiaCrypt ’91. Springer-Verlag 1993, 382-396.
15. [M097] Masahiro Mambo, Eiji Okamoto. Proxy cryptosystems: delegation of the power to decrypt ciphertexts. IEICE Trans. Fund. Electronics Communications and Comp Sci. E80-A/1 (1997) 54-63.
16. [MU096] Masahiro Mambo, Keisuke Usuda, and Eiji Okamoto. Proxy signatures: delegation of the power to sign messages. IEICE Trans. Fund, of Electronic Communications and Comp Sci. E79-A/9 (1996) 1338-1354.
17. [NIS91] NIST. A proposed federal information processing standard for digital signature standard (DSS). Draft Tech. Rep. FIPS PUB XXX, August 1991. Standards Publication (FIPS)
18. Tatsuaki Okamoto, Kazuo Ohta. Divertible zero-knowledge interactive proofs and commutative random self-reducibility. Eurocrypt ’89 LNCS 434, Springer-Verlag 1990, 134-149.
19. [RSA78] Ronald L. Rivest, Adi Shamir, Leonhard Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. CACM21/2 (1978) 120-126, reprinted: 26/1 (1983) 96-99.
20. [Sim83] Gustavus J. Simmons. A "Weak" Privacy Protocol Using the RSA Crypto Algorithm. Cryptologia 7/2 (1983) 180-182.
21. [Sim84] Gustavus J. Simmons. The Prisoners’ Problem and the Subliminal Channel. Crypto ’83. Plenum Press, New York 1984, 51-67.