Anonymous yet accountable access control

WPES'05: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society

Volumn , Issue , 2005, Pages 40-46

  Backes, Michael ^a   Camenisch, Jan ^a   Sommer, Dieter ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Access Control; Accountability; Anonymous Credentials; Anonymous Transactions; Certificates; Privacy

Indexed keywords

COMPUTER ARCHITECTURE; CRYPTOGRAPHY; DATA PRIVACY; DECISION MAKING; KNOWLEDGE ENGINEERING; RESOURCE ALLOCATION;

ACCESS CONTROL; ACCOUNTABILITY; ANONYMOUS CREDENTIALS; ANONYMOUS TRANSACTIONS; CERTIFICATES;

CONTROL SYSTEMS;

EID: 33749001998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102199.1102208     Document Type: Conference Paper

References (32)

1. BANGERTER, E., CAMENISCH, J., AND LYSYANSKAYA, A. A cryptographic framework for the controlled release of certified data. In Security Protocols 2004, LNCS.
2. BONATTI, P. A., AND SAMARATI, P. A uniform framework for regulating service access and information release on the web. J. Comput. Secur. 10, 3 (2002), 241-271.
3. BOUDOT, F. Efficient proofs that a committed number lies in an interval. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431-444.
4. BRANDS, S. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT'97, vol. 1233 of LNCS, Springer Verlag, pp. 318-333.
5. CAMENISCH, J., AND GROTH, J. Group signatures: Better efficiency and new theoretical aspects. In SCN 2004, pp. 120-133. LNCS, Springer Verlag.
6. CAMENISCH, J., AND LYSYANSKAYA, A. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In EUROCRYPT 2001, vol. 2045 of LNCS, Springer Verlag, pp. 93-118.
7. CAMENISCH, J., AND LYSYANSKAYA, A. A signature scheme with efficient protocols. In SCN 2002, vol. 2576 of LNCS, Springer Verlag, pp. 274-295.
8. CAMENISCH, J., AND LYSYANSKAYA, A. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO 2004, LNCS, Springer Verlag.
9. CAMENISCH, J., AND MICHELS, M. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT '99, vol. 1592 of LNCS.
10. CAMENISCH, J., AND MICHELS, M. Separability and efficiency for generic group signature schemes. In CRYPTO '99, vol. 1666 of LNCS, Springer Verlag, pp. 413-430.
11. CAMENISCH, J., AND SHOUP, V. Practical verifiable encryption and decryption of discrete logarithms. In CRYPTO 2003, LNCS. Springer Verlag.
12. CAMENISCH, J., SOMMER, D., AND ZIMMERMANN, R. A general certification framework with applications to privacy-enhancing certificate infrastructures. Tech. Rep. RZ 3629, IBM Research, July 2005.
13. CHAN, A., FRANKEL, Y., AND TSIOUNIS, Y. Easy come - easy go divisible cash. In EUROCRYPT'98, vol. 1403 of LNCS, Springer Verlag, pp. 561-575.
14. CHAUM, D., AND PEDERSEN, T. P. Wallet databases with observers. In CRYPTO '92, vol. 740 of LNCS, Springer-Verlag, pp. 89-105.
15. CRAMER, R., DAMGÅRD, I., AND SCHOENMAKERS, B. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO '94, vol. 839 of LNCS, Springer Verlag, pp. 174-187.
16. DAMGÅRD, I. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, vol. 1807 of LNCS, Springer Verlag, pp. 431-444.
17. DAMGÅRD, I., AND FUJISAKI, E. An integer commitment scheme based on groups with hidden order. In ASIACRYPT 2002, vol. 2501 of LNCS.
18. DESMEDT, Y., AND FRANKEL, Y. Threshold cryptography. In CRYPTO '89, vol. 435 of LNCS, pp. 307-315.
19. EUROPEAN PARLIAMENT. Directive 95/46/ec on the protection of individuals with regard to the processing of personal data and on the free movement of such data. Official Journal of the European Communities 31 (1995).
20. FARRELL, S., AND HOUSLEY, R. An Internet Attribute Certificate Profile for Authorization. RFC 3281 (Proposed Standard), Apr. 2002.
21. FUJISAKI, E., AND OKAMOTO, T. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO '97, vol. 1294 of LNCS, pp. 16-30.
22. GOLDWASSER, S., MICALI, S., AND RACKOFF, C. The knowledge complexity of interactive proof systems. In FOCS 1985, pp. 291-304.
23. HOUSLEY, R., POLK, W., FORD, W., AND SOLO, D. Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 3280 (Proposed Standard), Apr. 2002.
24. Li, N., MITCHELL, J. C., AND WINSBOROUGH, W. H. Design of a role-based trust management framework. In Proc. IEEE Symposium on Security and Privacy (2002).
25. PEDERSEN, T. P. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO '91, vol. 576 of LNCS, Springer Verlag, pp. 129-140.
26. Prime whitepaper. Whitepaper, 18 July 2005. http://www.prime-project.eu. org/prime/public/press_room/whitepaper/PRIME-Whitepaper-V1.pdf.
27. SAMARATI, P., June 2005. Personal communication.
28. SANTIS, A. D., CRESCENZO, G. D., PERSIANO, G., AND YUNG, M. On monotone formula closure of SZK. In FOCS 1994, IEEE, pp. 454-465.
29. SCHNORR, C. P. Efficient signature generation for smart cards. Journal of Cryptology 4, 3 (1991), 239-252.
30. Yu, T., MA, X., AND WINSLETT, M. Prunes: an efficient and complete strategy for automated trust negotiation over the internet. In ACM CCS'00, ACM Press, pp. 210-219.
31. Yu, T., WINSLETT, M., AND SEAMONS, K. E. Interoperable strategies in automated trust negotiation. In ACM CCS '01, pp. 146-155.
32. Yu, T., WINSLETT, M., AND SEAMONS, K. E. Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation. ACM Trans. Inf. Syst. Secur. 6, 1 (2003), 1-42.