• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Self-Delegation with Controlled Propagation -- or -- What If You Lose Your Laptop (1998)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.wisdom.weizmann.ac.il]
  • [www.semper.org]
  • [www.semper.org]
  • [theory.lcs.mit.edu]
  • [eprint.iacr.org]
  • [theory.lcs.mit.edu]
  • [csail.mit.edu]
  • [people.csail.mit.edu]
  • [theory.csail.mit.edu]
  • [theory.lcs.mit.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Oded Goldreich , Birgit Pfitzmann , Ronald L. Rivest
Citations:14 - 1 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Goldreich98self-delegationwith,
    author = {Oded Goldreich and Birgit Pfitzmann and Ronald L. Rivest},
    title = {Self-Delegation with Controlled Propagation -- or -- What If You Lose Your Laptop},
    booktitle = {},
    year = {1998},
    pages = {153--168},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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.

Citations

2292 New Directions in Cryptography - Diffie, Hellman
1404 How to share a secret - Shamir - 1979
1130 Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
892 C.: The knowledge complexity of interactive proof-systems (extended abstract - Goldwasser, Micali, et al. - 1985
706 A.: How to prove yourself: Practical solutions to identification and signature problems - Fiat, Shamir - 1986
544 How to construct random functions - Goldreich, Goldwasser, et al. - 1986
512 Efficient signature generation for smart cards - Schnorr - 1991
327 Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems - Goldreich, Micali, et al. - 1991
231 Collusion-secure fingerprinting for digital data (extended abstract - Boneh, Shaw - 1995
206 Bit Commitment Using Pseudo-Randomness - Naor - 1991
196 A Practical Scheme for Non-interactive Verifiable Secret Sharing - Feldman - 1987
176 B.: Verifiable secret sharing and achieving simultaneity in the presence of faults - Chor, Goldwasser, et al. - 1985
150 Witness indistinguishable and witness hiding protocols - Feige, Shamir - 1990
143 Multiple non-interactive zero knowledge proofs based on a single random string - Feige, Lapidot, et al. - 1990
121 On Defining Proofs of Knowledge - Bellare, Goldreich - 1993
104 Non-Interactive Zero-Knowledge and its Applications - Blum, Feldman, et al. - 1988
65 How to exchange (secret) keys - Blum - 1983
61 Distributed provers with applications to undeniable signatures - Pedersen - 1991
51 Anonymous Fingerprinting - Pfitzmann, Waidner - 1997
49 de Graaf. An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations - Chaum, Evertse, et al. - 1988
48 Moni Naor. Untraceable electronic cash - Chaum, Fiat
47 Disposable zero-knowledge authentications and their applications to untraceable electronic cash - Okamoto, Ohta - 1989
32 Achieving Electronic Privacy, Scientific American - Chaum - 1992
31 Fingerprinting Long Forgiving Messages - Blakley, Meadows, et al. - 1985
26 Quantifying knowledge complexity - Goldreich, Petrank - 1996
25 An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions - Kilian, Petrank - 1998
20 Showing credentials without identification: Transferring signatures between unconditionally unlinkable pseudonyms - Chaum - 1990
17 Divertible zero-knowledge interactive proofs and commutative random self-reducibility - Okamoto, Ohta - 1990
13 Pedersen: Wallet Databases with Observers - Chaum, P - 1993
1 Wagner: Fingerprinting - R
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University