Access controls for oblivious and anonymous systems

ACM Transactions on Information and System Security

Volumn 14, Issue 1, 2011, Pages

  Coull, Scott E ^a   Green, Matthew ^b   Hohenberger, Susan ^b  

^a RedJack ^*  (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Access controls; Anonymous credentials; Oblivious transfer

Indexed keywords

ACCESS CONTROL MODELS; ADAPTIVE OBLIVIOUS TRANSFER; ANONYMOUS CREDENTIAL; ANONYMOUS CREDENTIAL SYSTEMS; ANONYMOUS SYSTEMS; CONSTANT TIME; CREDENTIAL SYSTEMS; CRYPTOGRAPHIC PROTOCOLS; DETRIMENTAL EFFECTS; MULTI-LEVEL SECURITY; OBLIVIOUS TRANSFER; SET-UP PHASE; STATE INFORMATION; STATE MACHINE; STATE MACHINE MODELS; SYSTEM MODELS; THE STANDARD MODEL; USER BEHAVIORS;

ADAPTIVE CONTROL SYSTEMS; BEHAVIORAL RESEARCH; MATHEMATICAL MODELS; SECURITY SYSTEMS;

ACCESS CONTROL;

EID: 79959823641     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1952982.1952992     Document Type: Conference Paper

References (51)

1. AIELLO, W., ISHAI, Y., AND REINGOLD, O. 2001. Priced oblivious transfer: How to sell digital goods. In Advances in Cryptology (EUROCRYPT'01), Lecture Notes in Computer Science, vol. 2045, Springer, Berlin, 119-135. (Pubitemid 33275828)
2. BELL, D. E. AND PADULA, L. J. L. 1988. Secure computer system: Unified exposition and Multics interpretation. MITRE Corp., Bedford, MA.
3. BIBA, K. J. 1977. Integrity considerations for secure computer systems. Tech. rep. ESD-TR-76-372, MITRE Corp. Bedford, MA.
4. BLAKE, I. F. AND KOLESNIKOV, V. 2004. Strong Conditional Oblivious Transfer and Computing on Intervals. In Advances in Cryptology (ASIACRYPT'04), Lecture Notes in Computer Science, vol. 3329, Springer, Berlin, 515-529. (Pubitemid 39747776)
5. BONEH, D. AND BOYEN, X. 2004. Short signatures without random oracles. In Advances in Cryptology (EUROCRYPT'04), Lecture Notes in Computer Science, vol. 3027, Springer, Berlin, 56-73.
6. BONEH, D.,BOYEN, X., AND SHACHAM,H. 2004. Short group signatures. In Advances in Cryptology (CRYPTO'04), Lecture Notes in Computer Science, vol. 3152, Springer, Berlin, 227-242.
7. BOUDOT, F. 2000. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology (EUROCRYPT'00), Lecture Notes in Computer Science, vol. 1807, Springer, Berlin, 431-444.
8. BRANDS, S. 1997. Rapid demonstration of linear relations connected by boolean operators. In Advances in Cryptology (EUROCRYPT'97), Lecture Notes in Computer Science, vol. 1233. Springer, Berlin, 318-333. (Pubitemid 127067810)
9. BREWER, D. F. C. ANDNASH,M. J. 1989. TheChineseWall security policy. In Proceedings of the IEEESymposium on Security and Privacy. IEEE, Los Alamitos, CA, 206-214.
10. CAMENISCH, J. AND DAMGARD, I. 2000. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In Advances in Cryptology (ASIACRYPT '00), Lecture Notes in Computer Science, vol. 1976, 331-345.
11. CAMENISCH, J., DUBOVITSKAYA, M., AND NEVEN, G. 2009. Oblivious transfer with access controls. In Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS'09). ACM, New York, 131-140.
12. CAMENISCH, J., DUBOVITSKAYA, M., AND NEVEN, G. 2010. Unlinkable priced oblivious transfer with rechargeable wallets. In Financial Cryptography and Data Security, Lecture Notes in Computer Science, vol. 6052, Springer, Berlin.
13. CAMENISCH, J.,HOHENBERGER, S.,KOHLWEISS,M.,LYSYANSKAYA, A., ANDMEYEROVICH,M. 2006. How towin the clone wars: Efficient periodic n-times anonymous authentication. In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS '06). ACM, New York, 201-210. (Pubitemid 47131369)
14. CAMENISCH, J., HOHENBERGER, S., AND LYSYANSKAYA, A. 2005. Compact e-cash. In Advances in Cryptology (EUROCRYPT'05), Lecture Notes in Computer Science, vol. 3494, Springer, Berlin, 302-321. (Pubitemid 41313960)
15. CAMENISCH, J.,HOHENBERGER, S., AND LYSYANSKAYA, A. 2006. Balancing accountability and privacy using e-cash. In Security and Cryptography for Networks, Lecture Notes in Computer Science, vol. 4116, Springer, Berlin, 141-155. (Pubitemid 44568296)
16. CAMENISCH, J. AND LYSYANSKAYA, A. 2001. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology (EUROCRYPT'01), Lecture Notes in Computer Science, vol. 2045, Springer, Berlin, 93-118. (Pubitemid 33275827)
17. CAMENISCH, J. AND LYSYANSKAYA, A. 2003. A signature scheme with efficient protocols. In Security in Communication Networks, Lecture Notes in Computer Science, vol. 2576, Springer, Berlin, 268-289.
18. CAMENISCH, J. AND LYSYANSKAYA, A. 2004. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology (CRYPTO'04), Lecture Notes in Computer Science, vol. 3152, Springer, Berlin, 56-72.
19. CAMENISCH, J. AND MICHELS, M. 1999a. Proving in zero-knowledge that a number n is the product of two safe primes. In Advances in Cryptology (EUROCRYPT'99), Lecture Notes in Computer Science, vol. 1592, Springer, Berlin, 107-122.
20. CAMENISCH, J. AND MICHELS, M. 1999b. Seperability and efficiency for generic group signature schemes. In Advances in Cryptology (CRYPTO'99), Lecture Notes in Computer Science, vol. 1666, Springer, Berlin, 413-430.
21. CAMENISCH, J., NEVEN, G., AND SHELAT, A. 2007. Simulatable adaptive oblivious transfer. In Advances in Cryptology (EUROCRYPT'07), Lecture Notes in Computer Science, vol. 4515, Springer, Berlin, 573-590.
22. CAMENISCH, J. 1998. Group signature schemes and payment systems based on the discrete logarithm problem. Ph.D. dissertation, ETH Zurich.
23. CHAN, A., FRANKEL, Y., AND TSIOUNIS, Y. 1998. Easy come-easy go divisible cash. In Advances in Cryptology (EUROCRYPT'98), Lecture Notes in Computer Science, vol. 1403, Springer, Berlin, 561-575.
24. CHAUM, D. 1985. Security without identification: Transaction systems to make big brother obsolete. Comm. ACM 28,10, 1030-1044. (Pubitemid 15587967)
25. CHAUM, D. AND PEDERSEN, T. P. 1992.Wallet databases with observers. In Advances in Cryptology (CRYPTO'92), Lecture Notes in Computer Science, vol. 740, Springer, Berlin, 89-105.
26. CHOR, B., KUSHILEVITZ, E., GOLDREICH, O., AND SUDAN, M. 1998. Private information retrieval. J. ACM 45, 6, 965-981.
27. CLARK, D. D. AND WILSON, D. R. 1987. A Comparison of commercial and military computer security policies. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE, Washington, D.C., 27-29.
28. CRAMER, R., DAMGARD, I., AND MACKENZIE, P. 2000. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In Public Key Cryptography, Lecture Notes in Computer Science, vol. 1751, 354-372.
29. CRAMER, R., DAMGARD, I., AND SCHOENMAKERS, B. 1994. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology (CRYPTO'94), Lecture Notes in Computer Science, vol. 839, Springer, Berlin, 174-187.
30. CRESCENZO, G. D., OSTROVSKY, R., AND RAJAGOPOLAN, S. 1999. Conditional oblivious transfer and time released encryption. In Advances in Cryptology (EUROCRYPT'99), Lecture Notes in Computer Science, vol. 1592, Springer, Berlin, 74-89.
31. DAMGARD, I. AND FUJISAKI, E. 2002. An integer commitment scheme based on groups with hidden order. In Advances in Cryptology (ASIACRYPT'02), Lecture Notes in Computer Science, vol. 2501, Springer, Berlin, 125-142.
32. DEPARTMENT OF DEFENSE. 1985. Trusted computer system evaluation criteria. Tech. rep. DoD 5200.28-STD.
33. DODIS, Y. AND YAMPOLSKIY, A. 2005. A verifiable random function with short proofs and keys. In Public Key Cryptology (PKC'05), Lecture Notes in Computer Science, vol. 3386. Springer, Berlin, 416-431. (Pubitemid 41231346)
34. FISCHLIN, M. AND SCHRODER, D. 2009. Security of blind signatures under aborts. In Public Key Cryptography (PKC'09), Lecture Notes in Computer Science, vol. 5443, Springer, Berlin, 297-316.
35. FUJISAKI, E. AND OKAMOTO, T. 1997. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology (CRYPTO'97), Lecture Notes in Computer Science, vol. 1294, Springer, Berlin, 16-30. (Pubitemid 127112542)
36. GOLDREICH, O.,GOLDWASSER, S., ANDMICALI, S. 1986. How to construct random functions. J. ACM33, 4, 792-807.
37. GOLDREICH, O.,MICALI, S., AND WIGDERSON, A. 1986. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceeding of the 27th Annual Symposium on Foundations of Computer Science (FOCS'86), IEEE, Los Alamitos, CA, 174-187. (Pubitemid 17535962)
38. GOLDWASSER, S.,MICALI, S., AND RIVEST, R. L. 1988. A digital signature scheme secure against adaptive chosenmessage attacks. SIAM J. Comput. 17, 2, 281-308.
39. GOOGLE. 2009. Google Health. https://www.google.com/health.
40. GREEN, M. AND HOHENBERGER, S. 2007. Blind identity-based encryption and simulatable oblivious transfer. In Advances in Cryptology (ASIACRYPT'07), Lecture Notes in Computer Science, vol. 4833, Springer, Berlin, 265-282.
41. JARECKI, S. AND LIU, X. 2009. Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In Theory of Cryptography, Lecture Notes in Computer Science, vol. 5444, Springer, Berlin, 577-594.
42. LAMPSON, B. W. 1969. Dynamic protection structures. In Proceedings of the AFIPS '69 Fall Joint Computer Conference. ACM, New York, 27-38.
43. LYSYANSKAYA, A. 2002. Signature schemes and applications to cryptographic protocol design. Ph.D. dissertation, MIT, Cambridge, MA.
44. MICROSOFT. 2009. Microsoft HealthVault. http://www.healthvault.com/.
45. NAOR, M. AND PINKAS, B. 1999. Oblivious transfer with adaptive queries. In Advances in Cryptology (CRYPTO'99), Lecture Notes in Computer Science, vol. 1666, Springer, Berlin, 573-590.
46. NAOR, M. AND REINGOLD, O. 1997. Number-theoretic constructions of efficient pseudo-random functions. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS'97). IEEE, Los Alamitos, CA, 458-467.
47. OGATA, W. AND KUROSAWA, K. 2004. Oblivious keyword search. Special issue on coding and cryptography. J. Complexity 20, 2-3, 356-371.
48. PEDERSEN, T. P. 1992. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology (CRYPTO'92). Lecture Notes in Computer Science, vol. 576, Springer, Berlin, 129-140.
49. SCHNORR, C.-P. 1991. Efficient signature generation for smart cards. J. Cryptology 4, 3, 239-252.
50. TERANISHI, I., FURUKAWA, J., AND SAKO, K. 2004. k-times anonymous authentication. In Advances in Cryptology (ASIACRYPT'04), Lecture Notes in Computer Science, vol. 3329, Springer, Berlin, 308-322.
51. WATERS, B. 2005. Efficient identity-based encryption without random oracles. In Advances in Cryptology (EUROCRYPT'05), Lecture Notes in Computer Science, vol. 3494, Springer, Berlin, 114-127. (Pubitemid 41313949)