Conditional privacy using re-encryption

Proceedings - 2008 IFIP International Conference on Network and Parallel Computing, NPC 2008

Volumn , Issue , 2008, Pages 18-25

  Suriadi, ^a   Foo, Ernest ^a   Smith, Jason ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; CRYPTOGRAPHY; PARALLEL PROCESSING SYSTEMS;

CREDENTIAL SYSTEMS; ENCRYPTION KEYS; ENCRYPTION SCHEMES; ONLINE PERFORMANCES; PRIVATE INFORMATIONS; SECURE PROTOCOLS; SERVICE PROVIDERS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 57949113919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NPC.2008.37     Document Type: Conference Paper

References (14)

1. G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans. Inf. Syst. Secur., 9(1):1-30, 2006.
2. E. Bangerter, J. Camenisch, and A. Lysyanskaya. A cryptographic framework for the controlled release of certified data. In B. Christianson, B. Crispo, J. A. Malcolm, and M. Roe, editors, Security Protocols Workshop, volume 3957 of LNCS, pages 20-42. Springer, 2004.
3. S. Blake-Wilson and A. Menezes. Authenticated diffiehellman key agreement protocols. In S. E. Tavares and H. Meijer, editors, Selected Areas in Cryptography, volume 1556 of Lecture Notes in Computer Science, pages 339-361. Springer, 1998.
4. J. Camenisch and I. Damgård. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In T. Okamoto, editor, ASIACRYPT, volume 1976 of LNCS, pages 331-345. Springer, 2000.
5. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In S. Cimato, C. Galdi, and G. Persiano, editors, SCN, volume 2576 of LNCS, pages 268-289. Springer, 2002.
6. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In M. K. Franklin, editor, CRYPTO, volume 3152 of LNCS, pages 56-72. Springer, 2004.
7. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In D. Boneh, editor, CRYPTO, volume 2729 of LNCS, pages 126-144. Springer, 2003.
8. Y. Desmedt and Y. Frankel. Threshold cryptosystems. In G. Brassard, editor, CRYPTO, volume 435 of Lecture Notes in Computer Science, pages 307-315. Springer, 1989.
9. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th ACM Symposium on Foundations of Computer Science, pages 427-437, 1987.
10. P. Golle, M. Jakobsson, A. Juels, and P. F. Syverson. Universal re-encryption for mixnets. In T. Okamoto, editor, CT-RSA, volume 2964 of Lecture Notes in Computer Science, pages 163-178. Springer, 2004.
11. A.-A. Ivan and Y. Dodis. Proxy cryptography revisited. In NDSS. The Internet Society, 2003.
12. A. Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979.
13. S. Suriadi, E. Foo, and J. Smith. Conditional privacy using re-encryption. Technical Report 14076, Queensland University of Technology, October 2008. http://eprints.qut.edu.au/archive/00014076/.
14. S. Suriadi, E. Foo, and J. Smith. A user-centric protocol for conditional anonymity revocation. September 2008. To appear at 5th International Conference on Trust, Privacy & Security in Digital Business - TrustBus 2008.