Abstract
We present a scheme for quorum controlled asymmetric proxy re-encryption, with uses ranging from efficient key distribution for pay-tv to email applications. We prove that the scheme, which is based on El-Gamal encryption, leaks no information as long as there is no dishonest quorum of proxy servers. Of potential independent interest is a method providing publicly verifiable translation certificates, proving that the input and output encryptions correspond to the same plaintext message, without leaking any information about the plaintext to either the verifier or a subset of the servers of the prover. The size of the certificate is small, and independent of the number of prover servers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Bellare, P. Rogaway, “Random Oracles are Practical: a paradigm for designing eficient protocols,” 1st ACM Conference on Computer and Communications Security, pp. 62–73, 1993.
M. Blaze, G. Bleumer, M. Strauss, “Divertible Protocols and Atomic Proxy Cryptography,” Eurocrypt’ 98, pp. 127–144
D. Chaum, H. VanAntwerpen, “Undeniable Signatures,” Crypto’ 89, pp. 212–216
D. Chaum, “Zero-Knowledge Undeniable Signatures,” Eurocrypt’ 90, pp. 458–464
A. DeSantis, Y. Desmedt, Y. Frankel, and M. Yung, “How to Share a Function Securely,” STOC’ 94, pp. 522–533
T. ElGamal “A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” Crypto’ 84, pp. 10–18
Y. Frankel, P. Gemmell, P. MacKenzie, M. Yung, “Proactive RSA,” Proc. of CRYPTO’ 97, pp. 440–454
S. Goldwasser and S. Micali, “Probabilistic Encryption,” J. Comp. Sys. Sci. 28, pp 270–299, 1984.
A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, “Proactive Secret Sharing, or How to Cope with Perpetual Leakage,” Crypto’ 95, pp. 339–352
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
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.
T. P. Pedersen. “Non-interactive and information-theoretic secure verifiable secret sharing,” Crypto’ 91, pp. 129–140
D. Pointcheval, J. Stern, “Security Proofs for Signature Schemes,” Eurocrypt’ 96, pp. 387–398
C. P. Schnorr, “Efficient Signature Generation for Smart Cards,” Advances in Cryptology-Proceedings of Crypto’ 89, pp. 239–252
A. Shamir, “How to Share a Secret,” Communications of the ACM, Vol. 22, 1979, pp. 612–613
D. Tygar, B. Yee, “Strongbox: A System for Self Securing Programs,” CMU Computer Science: 25th Anniversary Commemorative, Addison-Wesley, 1991
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
B. Yee, “Using Secure Coprocessors,” Ph.D. Thesis, Carnegie Mellon University, CMU-CS-94-149, 1994
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakobsson, M. (1999). On Quorum Controlled Asymmetric Proxy Re-encryption. In: Public Key Cryptography. PKC 1999. Lecture Notes in Computer Science, vol 1560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49162-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-49162-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65644-9
Online ISBN: 978-3-540-49162-0
eBook Packages: Springer Book Archive