Skip to main content

Time Constraint Delegation for P2P Data Decryption

  • Conference paper
  • 821 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2802))

Abstract

Large amount of digital content would be stored safely in peer-to-peer network, with encrypted format. Being requested, a cipher text is downloaded from certain peer and decrypted by a delegated decryptor to obtain the clear text. Observing the need for this new kind of delegation decryption service, we propose a novel time constraint delegation scheme for decrypting p2p data in this paper. The new features of the delegation scheme are that: it uses a flexible secure mobile agent solution without designated delegation server; the time constraint conditional parameter is clearly bound with the protocols; and the computation complexity is greatly reduced by replacing public key computation with hash function. We elaborate the protocol design as well as its security, extensions and properties. Potential applications in content delivery network and pervasive computing scenarios are depicted.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akamai technologies Inc. EdgeSuite product, http://www.akamai.com

  2. http://www.jxta.org

  3. NIST FIPS PUB 180. Secure Hash Standard. NIST (May 1993)

    Google Scholar 

  4. El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  5. Watanabe, Y., Numao, M.: Conditional Cryptographic Delegation for P2P Data Sharing. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 309–321. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Mambo, M., Okamoto, E.: Proxy cryptosystems: Delegation of the power to decrypt ciphertexts. IEICE Trans. Fund. Electronics Communications and Comp. Sci. E80-A/1, 54–63 (1997)

    Google Scholar 

  7. Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127–144. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Jakobsson, M.: On quorum controlled asymmetric proxy re-encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 112–121. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Horne, B., Pinkas, B., Sander, T.: Escrow services and incentives in peer-to-peer networks. In: Proc. of ACM EC 2001 (2001)

    Google Scholar 

  10. Giles, J., Sailer, R., Verma, D., Chari, S.: Authentication for Distributed Web Caches. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol. 2502, pp. 126–146. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Graf, M.: Demo: Fluid computing. In: First International Conference, Pervasive 2002, Zürich, Switzerland, August 26-28 (2002)

    Google Scholar 

  12. OceanStore project, http://oceanstore.cs.berkeley.edu

  13. Schelderup, K., Ølnes, J.: Mobile agent security-issues and directions. In: Zuidweg, H., Campolargo, M., Delgado, J., Mullery, A. (eds.) IS&N 1999. LNCS, vol. 1597, pp. 155–167. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Mambo, M., Usuda, K., Okamoto, E.: Proxy signatures: delegation of the power to sign messages. IEICE Trans. Fund. of Electronic Communications and Comp Sci. E79-A/9, 1338–1354 (1996)

    Google Scholar 

  15. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, TY. (2004). Time Constraint Delegation for P2P Data Decryption. In: Hutter, D., Müller, G., Stephan, W., Ullmann, M. (eds) Security in Pervasive Computing. Lecture Notes in Computer Science, vol 2802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39881-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39881-3_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20887-7

  • Online ISBN: 978-3-540-39881-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics