Skip to main content

Grouping Verifiable Content for Selective Disclosure

  • Conference paper
  • First Online:

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

Abstract

This paper addresses the issue of selective disclosure of verifiable content. It extends previous work relating to Content Extraction Signatures [21] to implement a more complex structure that encodes a richer, more flexible fragment extraction policy, which includes fragment grouping. The new extraction policy enables the signer to specify both optional and mandatory fragment associations (or groupings) for verifying extracted content.

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. S. Baker. Don’t worry be happy. Available online, June 1994. [Last accessed: July 27, 2002]. http://www.wired.com/wired/archive/2.06/nsa.clipper pr.html

  2. M. Bartel, J. Boyer, B. Fox, B. LaMacchia, and E. Simon. XML-signature syntax and processing. In D. Eastlake, J. Reagle, and D. Solo, editors, W3C Recommendation. Feb. 12 2002. [Last accessed: September 18, 2002]. http://www.w3.org/TR/2002/REC-xmldsig-core-20020212/

  3. M. Bellare and G. Neven. Transitive signatures based on factoring and RSA. In Y. Zheng, editor, Proceedings of The 8th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2002), volume 2501 of Lecture Notes in Computer Science, pages 397–414. Springer, December 2003.

    Google Scholar 

  4. T. Beth, M. Frisch, and G. Simmons, editors. Public-Key Cryptography: State of the Art and Future Directions, volume 578 of Lecture Notes in Computer Science. Springer, July 1992. E.I.S.S. Workshop Oberwolfach Final Report.

    MATH  Google Scholar 

  5. G. Blakley. Twenty years of cryptography in the open literature. In Proceedings of 1999 IEEE Symposium on Security and Privacy, pages 106–7. IEEE Computer Society, May 1999.

    Google Scholar 

  6. S. Brands. Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Cambridge, MA, 2000.

    Google Scholar 

  7. S. Brands. A technical overview of digital credentials. Available online, Feb. 20 2002. [Last accessed: February 18, 2003]. http://www.credentica.com/technology/overview.pdf

  8. L. Bull, D. M. Squire, J. Newmarch, and Y. Zheng. Grouping verifiable content for selective disclosure using XML signatures. Technical Report, School of Computer Science and Software Engineering, Monash University, 900 Dandenong Road, Caulfield East, Victoria 3145 Australia, April 2003.

    Google Scholar 

  9. L. Bull, P. Stanski, and D. M. Squire. Content extraction signatures using XML digital signatures and custom transforms on-demand. In Proceedings of The 12th International World Wide Web Conference (WWW2003), Budapest, Hungary, 20–24 May 2003. (to appear).

    Google Scholar 

  10. M. Crompton. The privacy act and the Australian federal privacy commissioner’s functions. In Proceedings of the tenth conference on computers, freedom and privacy, pages 145–8. ACM Press, 2000.

    Google Scholar 

  11. P. T. Devanbu, M. Gertz, A. Kwong, C. Martel, G. Nuckolls, and S. G. Stubblebine. Flexible authentication of XML documents. In ACM Conference on Computer and Communications Security, pages 136–45, 2001.

    Google Scholar 

  12. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644–54, 1976.

    Article  MathSciNet  Google Scholar 

  13. R. Johnson, D. Molnar, D. Song, and D. Wagner. Homomorphic signature schemes. In Proceedings of the RSA Security Conference Cryptographers Track, volume 2271 of Lecture Notes in Computer Science, pages 244–62. Springer, February 2002.

    Google Scholar 

  14. S. Micali and R. L. Rivest. Transitive signature schemes. In B. Preneel, editor, Proceedings of The Cryptographer’s Track at the RSA Conference (CT-RSA 2002), volume 2271 of Lecture Notes in Computer Science, pages 236–243. Springer, December 2002.

    Google Scholar 

  15. Office of the Federal Privacy Commissioner. My privacy my choice-your new privacy rights. Available online. [Last accessed: July 31, 2002]. http://www.privacy.gov.au/privacy rights/npr.html

  16. Office of the Federal Privacy Commissioner. Privacy in Australia. Available online, October 2001. [Last accessed: July 12, 2002]. http://www.privacy.gov.au/publications/pia.html

  17. Office of the Federal Privacy Commissioner. Announcement: Transurban privacy review completed. Available online, May 2002. [Last accessed: July 31, 2002]. http://www.privacy.gov.au/news/media/02_9.html

  18. H. Orman. Data integrity for mildly active content. In Proceedings of Third Annual International Workshop on Active Middleware Services, pages 73–7. IEEE Computer Society, March 2002.

    Google Scholar 

  19. R. Rivest. Two signature schemes. Available online, October 2000. Slides from talk given at Cambridge University. [Last accessed: February 19, 2003]. http://www.theory.lcs.mit.edu/rivest/publications.html

  20. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–8, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  21. R. Steinfeld, L. Bull, and Y. Zheng. Content extraction signatures. In Proceedings of The 4th International Conference on Information Security and Cryptology (ICISC 2001), volume 2288 of Lecture Notes in Computer Science, pages 285–304. Springer, December 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bull, L., Squire, D.M., Newmarch, J., Zheng, Y. (2003). Grouping Verifiable Content for Selective Disclosure. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45067-X_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40515-3

  • Online ISBN: 978-3-540-45067-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics