Abstract
We introduce delegation schemes wherein a user may delegate certain rights to himself, but may not safely delegate these rights to others. In our motivating application, a user has a primary (long-term) key that receives some personalized access rights, yet the user may reasonably wish to delegate these rights to new secondary (short-term) keys he creates to use on his laptop when traveling, to avoid having to store his primary secret key on the vulnerable laptop. We propose several cryptographic schemes, both generic ones under general assumptions and more specific practical ones, that fulfill these somewhat conflicting requirements, without relying on special-purpose (e.g., tamper-proof) hardware.
This is an extended abstract of our work [19].
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bellare and O. Goldreich: On Defining Proofs of Knowledge; in Crypto '92, Springer-Verlag, LNCS Vol. 740, pp. 390–420, 1992.
M. Blum: How to Exchange (Secret) Keys; ACM Transactions on Computer Systems, Vol. 1, No. 2, pp. 175–193, 1983.
M. Blum, P. Feldman, and S. Micali: Non-Interactive Zero-Knowledge and its Applications; in 20th STOC, pp. 103–112, 1988.
D. Chaum: Showing credentials without identification: Transferring signatures between unconditionally unlinkable pseudonyms; in Auscrypt '90, LNCS 453, Springer-Verlag, Berlin 1990, pages 246–264.
D. Chaum: Achieving Electronic Privacy; Scientific American, August, pp. 96–101, 1976.
D. Chaum, J.-H. Evertse, and J. van de Graaf: An improved protocol for demonstrating possession of discrete logarithms and some generalizations; in Eurocrypt '87, Springer-Verlag, LNCS Vol. 304, pp. 127–141, 1988.
D. Chaum, A. Fiat and M. Naor: Untraceable Electronic Cash; in Crypto '88, LNCS 403, Springer-Verlag, Berlin 1990, pages 319–327.
B. Chor, S. Goldwasser, S. Micali and B. Awerbuch: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults; in 26th FOCS, pages 383–395, 1985.
W. Diffie and M. E. Hellman: New Directions in Cryptography; IEEE Transactions on Information Theory, Vol. 22, No. 6, pp. 644–654, 1976.
C. Dwork, J. Lotspiech, and M. Naor: Digital Signets: Self-Enforcing Protection of Digital Information; in 28th STOC, pp. 489–498, 1996.
The Digital Signature Standard Proposed by NIST; Communications of the ACM, Vol. 35, No. 7, pp. 36–40, 1992.
U. Feige, D. Lapidot, and A. Shamir: Multiple non-interactive zero knowledge proofs based on a single random string; in 31st FOCS, pp. 308–317, 1990.
P. Feldman: A practical scheme for non-interactive verifiable secret sharing; in 20th FOCS, pp. 427–437, 1987.
U. Feige and A. Shamir: Witness Indistinguishability and Witness Hiding Protocols; in 22nd STOC, pp. 416–426, 1990.
A. Fiat and A. Shamir: How to Prove Yourself: Practical Solutions to Identification and Signature Problems; in Crypto '86, Springer-Verlag, LNCS Vol. 263, pp. 186–194, 1987.
O. Goldreich, S. Goldwasser, S. Micali: How to Construct Random Functions; Journal of the ACM, Vol. 33, No. 4, pp. 792–807, 1986.
O. Goldreich, S. Micali, and A. Wigderson: Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems; Journal of the ACM, Vol. 38, No. 1, pp. 691–729, 1991.
O. Goldreich and E. Petrank: Quantifying Knowledge Complexity; in 32nd FOCS, pp. 59–68, 1991. To appear in Computational Complexity.
O. Goldreich, B. Pfitzmann and R.L. Rivest: Self-Delegation with Controlled Propagation — or — What If You Lose Your Laptop; Record 97-12 of the Theory of Cryptography Library, url: http://theory.lcs.mit.edu/~tcryptol.
S. Goldwasser, S. Micali, and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems; SIAM Journal on Computing, Vol. 18, No. 1, pp. 186–208, 1989.
J. Kilian and E. Petrank: An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions; Journal of Cryptology, Vol. 11, No. 1, pp. 1–27, 1998.
M. Naor: Bit Commitment Using Pseudorandomness; Journal of Cryptology, Vol. 4, No. 2, pp. 151–158, 1991.
T. Okamoto and K. Ohta: Disposable Zero-Knowledege Authentications and their Applications to Untraceable Electronic Cash; in Crypto '89, LNCS 435, Springer-Verlag, Berlin 1990, pages 481–496.
T. P. Pedersen: Distributed Provers with Applications to Undeniable Signatures; in Eurocrypt '91, Springer-Verlag, LNCS Vol. 547, pp. 221–242, 1991.
C. P. Schnorr: Efficient Signature Generation by Smart Cards; Journal of Cryptology, Vol. 4, No. 3, pp. 161–174, 1991.
A. Shamir: How to Share a Secret; Communications of the ACM, Vol. 22, No. 11, pp. 612–613, 1979.
N. R.Wagner: Fingerprinting; in Proceedings of IEEE Symposium on Security and Privacy, pp. 18–22, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldreich, O., Pfitzmann, B., Rivest, R.L. (1998). Self-delegation with controlled propagation — or — What if you lose your laptop. In: Krawczyk, H. (eds) Advances in Cryptology — CRYPTO '98. CRYPTO 1998. Lecture Notes in Computer Science, vol 1462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055726
Download citation
DOI: https://doi.org/10.1007/BFb0055726
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64892-5
Online ISBN: 978-3-540-68462-6
eBook Packages: Springer Book Archive