|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
M. Bellare , S. Micali , R. Ostrovsky, The (true) complexity of statistical zero knowledge, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.494-502, May 13-17, 1990, Baltimore, Maryland, United States
[doi> 10.1145/100216.100285]
|
| |
2
|
|
| |
3
|
l~.,I. BELLARE AND S. GOLDWASSEK. Verifiable partial key escrow. Technical Report number CS95-447, Dept of CS and Engineering, UCSD, October 1995.
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
M. Bt~LLARE AND P. ROGAWAY. Optimal asymmetric encryption. Advances in Cryp~ology- Eurocr~Tt 94 Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994.
|
 |
8
|
Thomas Beth , Hans-Joachim Knobloch , Marcus Otten , Gustavus J. Simmons , Peer Wichmann, Towards acceptable key escrow systems, Proceedings of the 2nd ACM Conference on Computer and communications security, p.51-58, November 1994, Fairfax, Virginia, United States
[doi> 10.1145/191177.191191]
|
| |
9
|
G. BLAKLE~Y. Safeguarding cryptographic keys. AFIPS Conference Proceedings, June 1979.
|
 |
10
|
|
| |
11
|
|
| |
12
|
B. CHOR, S. GOLDWASSER, S. MIOALI, AND B. AWERBUOH. Verifiable secret sharing and achieving simultaneity in the presence of faults. Proceedings of the 27th Ss~nposium on Foundations of Computer Science, IEEE, 1986.
|
| |
13
|
R. CRAMEP~ Private communication, January 17, 1996.
|
| |
14
|
|
 |
15
|
|
| |
16
|
D. DENNING AND M. SMID. Key escrowing now. IEEE Communications Magazine, Sep. 1994.
|
| |
17
|
Y. DESMEDT. Securing traceability of ciphertexts: towards a secure software key escrow system. Advances in Cryptology- Eurocrypt 95 Proceedings, Lecture Notes in Computer Science Vol. 921, L. Guillou and J. Quisquater ed., Springer-Verlag, 1995.
|
| |
18
|
W. DIFFIE AND M. HELLMAN. New directions in cryptography. IEEE Trans. Into. Theory IT-22, pp. 644- 654, November 1976.
|
| |
19
|
|
 |
20
|
|
| |
21
|
P. FELDMAN. A practical scheme for non-interactive verifiable secret sharing. Proceedings of the 28th Symposium on Foundations of Computer Science, IEEE, 1987.
|
| |
22
|
|
| |
23
|
|
| |
24
|
|
| |
25
|
H. LENSTRA. Factoring integers with elliptic curves. Annals of Math Vol. 126, pp. 649-673, 1987.
|
| |
26
|
|
| |
27
|
|
| |
28
|
S. MIOALI. Guaranteed partial key escrow. MIT Laboratory for Computer Science Technical Memo. 537, September 1995.
|
| |
29
|
S. MIOALI AND A. SHAMIR. Partial key escrow. Manuscript, February 1996.
|
| |
30
|
|
| |
31
|
A. ODLYZKO. The future of integer factorhation. CryptoBytes, RSA Labs Newsletter, Vol 1, No. 2, pp. 5-12, Summer 1995.
|
| |
32
|
1%. Ozz~E. Prepared remarks. Delivered at RSA Data Security Conference, San Francisco, January 17, 1996. Available at http:// wT;w.lotus, com/notesr4/ ozzie .htm.
|
| |
33
|
T. PEDEI%SEN. Distributed provers with applications to undeniable signatures. Advances in Cryptology- Eurocrypt 91 Proceedings, Lecture Notes in Computer Science Vol. 547, D. Davies ed., Springer-Verlag, 1991.
|
| |
34
|
|
| |
35
|
|
 |
36
|
|
 |
37
|
|
| |
38
|
A. SHAM{R. Partial key escrow: A new approach to software key escrow. Private communication made at Crypto 95, August 1995. Also presented at Key escrow conference, Washington, D.C.~ September 15, 1995.
|
| |
39
|
O. SCHNORR. Efficient signature generation by smart cards. Journal of Cryptology, Vo}. 4, pp. 161-174, 1991.
|
| |
40
|
P. VAN OORSCHOT AND M. WIENER. Oil_ Diffie- Hellman key agreement ~dth short exponents. Advances in Cryptology- Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed.3 Springer-Verlag, 1996.
|
| |
41
|
White House press release regarding the Clipper Chip, April 16, 1993. Also Escrowed Encryption Standard (EES), Federal Information Processing Standards Publication (FIPS PUB) 185, 1994.
|
| |
42
|
|
|