On quorum controlled asymmetric proxy re-encryption

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

Volumn 1560, Issue , 1999, Pages 112-121

  Jakobsson, Markus ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Asymmetric proxy re encryption; El Gamal encryption; Privacy; Quorum control; Robustness; Translation certificate

Indexed keywords

CHROMIUM COMPOUNDS; DATA PRIVACY; ROBUSTNESS (CONTROL SYSTEMS);

INPUT AND OUTPUTS; KEY DISTRIBUTION; PLAINTEXT; PROXY RE ENCRYPTIONS; PROXY SERVER; PUBLICLY VERIFIABLE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84956869808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49162-7_9     Document Type: Conference Paper

References (18)

1. M. Bellare, P. Rogaway, “Random Oracles are Practical: a paradigm for designing efficient protocols,” 1st ACM Conference on Computer and Communications Security, pp. 62-73, 1993.
2. M. Blaze, G. Bleumer, M. Strauss, “Divertible Protocols and Atomic Proxy Cryptography,” Eurocrypt ’98, pp. 127-144.
3. D. Chaum, H. Van Antwerpen, “Undeniable Signatures,” Crypto ’89, pp. 212-216.
4. D. Chaum, “Zero-Knowledge Undeniable Signatures,” Eurocrypt ’90, pp. 458-464.
5. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung, “How to Share a Function Securely,” STOC ’94, pp. 522-533.
6. T. ElGamal. “A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” Crypto ’84, pp. 10-18.
7. Y. Frankel, P. Gemmell, P. MacKenzie, M. Yung, “Proactive RSA,” Proc. of CRYPTO ’97, pp. 440-454.
8. S. Goldwasser and S. Micali, “Probabilistic Encryption,” J. Comp. Sys. Sci. 28, pp 270-299, 1984.
9. A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, “Proactive Secret Sharing, or How to Cope with Perpetual Leakage,” Crypto ’95, pp. 339-352.
10. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, M. Yung, ‘‘Proactive Public Key and Signature Systems,” Proceedings of the 4th ACM Conference on Computer and Communications Security, 1997, pp. 100-110.
11. T. P. Pedersen. A threshold cryptosystem without a trusted party. In D. W. Davies, editor, Advances in Cryptology – EUROCRYPT ’91, volume 547 of Lecture Notes in Computer Science, pp. 522-526. Springer-Verlag, 1991.
12. T. P. Pedersen. “Non-interactive and information-theoretic secure verifiable secret sharing,” Crypto ’91, pp. 129-140.
13. D. Pointcheval, J. Stern, “Security Proofs for Signature Schemes,” Eurocrypt ’96, pp. 387-398.
14. C. P. Schnorr, “Efficient Signature Generation for Smart Cards,” Advances in Cryptology - Proceedings of Crypto ’89, pp. 239-252.
15. A. Shamir, “How to Share a Secret,” Communications of the ACM, Vol. 22, 1979, pp. 612-613.
16. D. Tygar, B. Yee, “Strongbox: A System for Self Securing Programs,” CMU Computer Science: 25th Anniversary Commemorative, Addison-Wesley, 1991.
17. B. Yee, D. Tygar, “Secure Coprocessors in Electronic Commerce Applications,” Proceedings of the First USENIX Workshop on Electronic Commerce, New York, New York, July, 1995.
18. B. Yee, “Using Secure Coprocessors,” Ph.D. Thesis, Carnegie Mellon University, CMU-CS-94-149, 1994.