
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jiangtao Li, Ninghui Li, "OACerts: Oblivious Attribute Certificates," IEEE Transactions on Dependable and Secure Computing, vol. 3, no. 4, pp. 340352, OctoberDecember, 2006.  
BibTex  x  
@article{ 10.1109/TDSC.2006.54, author = {Jiangtao Li and Ninghui Li}, title = {OACerts: Oblivious Attribute Certificates}, journal ={IEEE Transactions on Dependable and Secure Computing}, volume = {3}, number = {4}, issn = {15455971}, year = {2006}, pages = {340352}, doi = {http://doi.ieeecomputersociety.org/10.1109/TDSC.2006.54}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Dependable and Secure Computing TI  OACerts: Oblivious Attribute Certificates IS  4 SN  15455971 SP340 EP352 EPD  340352 A1  Jiangtao Li, A1  Ninghui Li, PY  2006 KW  Security and privacy protection KW  access controls KW  privacy KW  cryptographic controls. VL  3 JA  IEEE Transactions on Dependable and Secure Computing ER   
[1] M. Blaze, J. Feigenbaum, and J. Lacy, “Decentralized Trust Management,” Proc. 1996 IEEE Symp. Security and Privacy, pp.164173, May 1996, .
[2] R.L. Rivest and B. Lampson, “SDSI—A Simple Distributed Security Infrastructure,” http://www.crypto.com/papers/policy maker.pdfhttp:/ /theory.lcs.mit.edu/~rivestsdsi11.html , Oct. 1996.
[3] C. Ellison, B. Frantz, B. Lampson, R. Rivest, B. Thomas, and T. Ylonen, “SPKI Certificate Theory,” IETF RFC 2693, Sept. 1999.
[4] D. Clarke, J.E. Elien, C. Ellison, M. Fredette, A. Morcos, and R.L. Rivest, “Certificate Chain Discovery in SPKI/SDSI,” J. Computer Security, vol. 9, no. 4, pp. 285322, 2001.
[5] N. Li, W.H. Winsborough, and J.C. Mitchell, “Distributed Credential Chain Discovery in Trust Management,” J. Computer Security, vol. 11, no. 1, pp. 3586, Feb. 2003.
[6] N. Li, J.C. Mitchell, and W.H. Winsborough, “Design of a RoleBased Trust Management Framework,” Proc. 2002 IEEE Symp. Security and Privacy, pp. 114130, May 2002.
[7] R. Housley, W. Ford, T. Polk, and D. Solo, “Internet X.509 Public Key Infrastructure Certificate and CRL Profile,” IETF RFC 2459, Jan. 1999, http://www.ietf.org/rfcrfc2459.txt.
[8] D. Chaum, “Security without Identification: Transaction Systems to Make Big Brother Obsolete,” Comm. ACM, vol. 28, no. 10, pp.10301044, 1985.
[9] S.A. Brands, Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Aug. 2000.
[10] A. Lysyanskaya, R.L. Rivest, A. Sahai, and S. Wolf, “Pseudonym Systems,” Proc. Sixth Workshop Selected Areas in Cryptography, pp.184199, 1999.
[11] J. Camenisch and A. Lysyanskaya, “An Efficient System for NonTransferable Anonymous Credentials with Optional Anonymity Revocation,” Advances in Cryptology, Proc. EUROCRYPT '01, pp.93118, 2001.
[12] J. Camenisch and E.V. Herreweghen, “Design and Implementation of the Idemix Anonymous Credential System,” Proc. Ninth ACM Conf. Computer and Comm. Security, pp. 2130, Nov. 2002.
[13] T.P. Pedersen, “NonInteractive and InformationTheoretic Secure Verifiable Secret Sharing,” Advances in Cryptology, Proc. CRYPTO '91, pp. 129140, 1991.
[14] E. Fujisaki and T. Okamoto, “Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations,” Advances in Cryptology, Proc. CRYPTO '97, pp. 1630, 1997.
[15] R. Cramer and I. Damgård, “ZeroKnowledge Proof for Finite Field Arithmetic, Or: Can ZeroKnowledge Be for Free,” Advances in Cryptology, Proc. CRYPTO '98, pp. 424441, 1998.
[16] I. Damgård and E. Fujisaki, “An Integer Commitment Scheme Based on Groups with Hidden Order,” Advances in Cryptology, Proc. ASIACRYPT '02, pp. 125142, Dec. 2002.
[17] R. Cramer, M.K. Franklin, B. Schoenmakers, and M. Yung, “MultiAuthority SecretBallot Elections with Linear Work,” Advances in Cryptology, Proc. EUROCRYPT '96, pp. 7283, 1996.
[18] W. Mao, “Guaranteed Correct Sharing of Integer Factorization with OffLine Shareholders,” Proc. First Int'l Workshop Practice and Theory in Public Key Cryptography, pp. 6071, Feb. 1998.
[19] G. Durfee and M. Franklin, “Distribution Chain Security,” Proc. Seventh ACM Conf. Computer and Comm. Security, pp. 6370, 2000.
[20] F. Boudot, “Efficient Proofs that a Committed Number Lies in an Interval,” Advances in Cryptology, Proc. EUROCRYPT '00, pp. 431444, May 2000.
[21] A.C. Yao, “How to Generate and Exchange Secrets,” Proc. 27th IEEE Symp. Foundations of Computer Science, pp. 162167, 1986.
[22] O. Goldreich, S. Micali, and A. Wigderson, “How to Play Any Mental Game,” Proc. 19th ACM Conf. Theory of Computing, pp. 218229, May 1987.
[23] O. Goldreich, The Foundations of Cryptography—Volume 2. Cambridge Univ. Press, May 2004.
[24] M. Bellare and P. Rogaway, “Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols,” Proc. First ACM Conf. Computer and Comm. Security, pp. 6273, 1993.
[25] J.E. Holt, R.W. Bradshaw, K.E. Seamons, and H. Orman, “Hidden Credentials,” Proc. Second ACM Workshop Privacy in the Electronic Soc., pp. 18, Oct. 2003.
[26] R. Bradshaw, J. Holt, and K. Seamons, “Concealing Complex Policies with Hidden Credentials,” Proc. 11th ACM Conf. Computer and Comm. Security, pp. 146157, Oct. 2004.
[27] K.B. Frikken, M.J. Atallah, and J. Li, “Hidden Access Control Policies with Hidden Credentials,” Proc. Third ACM Workshop Privacy in the Electronic Soc., Oct. 2004.
[28] D. Balfanz, G. Durfee, N. Shankar, D. Smetters, J. Staddon, and H.C. Wong, “Secret Handshakes from PairingBased Key Agreements,” Proc. IEEE Symp. and Security and Privacy, pp. 180196, May 2003.
[29] N. Li, W. Du, and D. Boneh, “Oblivious SignatureBased Envelope,” Proc. 22nd ACM Symp. Principles of Distributed Computing, pp. 182189, July 2003.
[30] G.D. Crescenzo, R. Ostrovsky, and S. Rajagopalan, “Conditional Oblivious Transfer and TimedRelease Encryption,” Advances in Cryptology, Proc. EUROCRYPT '99, pp. 7489, Mar. 1999.
[31] C. Crépeau, “Verifiable Disclosure of Secrets and Applications (Abstract),” Advances in Cryptology, Proc. EUROCRYPT '89, pp.150154, 1990.
[32] J. Garay, P. MacKenzie, and K. Yang, “Efficient and Universally Composable Committed Oblivious Transfer and Applications,” Proc. Theory of Cryptography Conf. (TCC '04), pp.297316, 2004.
[33] M. Naor and B. Pinkas, “Efficient Oblivious Transfer Protocols,” Proc. SIAM Symp. Discrete Algorithms, pp. 448457, Jan. 2001.
[34] W.G. Tzeng, “Efficient 1Outn Oblivious Transfer Schemes,” Proc. Fifth Int'l Workshop Practice and Theory in Public Key Cryptography, pp. 159171, 2002.
[35] M. Fischlin, “A CostEffective PayperMultiplication Comparison Method for Millionaires,” Proc. 2001 Conf. Topics in Cryptology (CTRSA '01), pp. 457472, 2001.
[36] S. Boeyen, T. Howes, and P. Richard, “Internet X.509 Public Key Infrastructure LDAPc2 Schema,” IETF RFC 2587, June 1999.
[37] S. Farrell and R. Housley, “An Internet Attribute Certificate Profile for Authorization,” IETF RFC 3281, Apr. 2002, http://www.ietf.org/rfcrfc3281.txt.
[38] E. Rescorla, SSL, TLS: Designing, and Building Secure Systems. AddisonWesley, 2001.
[39] W.H. Winsborough, K.E. Seamons, and V.E. Jones, “Automated Trust Negotiation,” Proc. DARPA Information Survivability Conf. and Exposition, vol. I, pp. 88102, Jan. 2000.
[40] W.H. Winsborough and N. Li, “Towards Practical Automated Trust Negotiation,” Proc. Third Int'l Workshop Policies for Distributed Systems and Networks, pp. 92103, June 2002.
[41] M. Winslett, T. Yu, K.E. Seamons, A. Hess, J. Jacobson, R. Jarvis, B. Smith, and L. Yu, “Negotiating Trust on the Web,” IEEE Internet Computing, vol. 6, no. 6, pp. 3037, Nov./Dec. 2002.
[42] T. Yu, M. Winslett, and K.E. Seamons, “Supporting Structured Credentials and Sensitive Policies through Interoperable Strategies for Automated Trust Negotiation,” ACM Trans. Information and System Security, vol. 6, no. 1, pp. 142, Feb. 2003.
[43] S. Goldwasser, S. Micali, and C. Rackoff, “The Knowledge Complexity of Interactive Proof Systems,” SIAM J. Computing, vol. 18, pp. 186208, Feb. 1989.
[44] W. Diffie and M.E. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. 22, pp. 644654, 1976.
[45] N. Li, W. Du, and D. Boneh, “Oblivious SignatureBased Envelope,” Distributed Computing, vol. 17, no. 4, pp. 293302, 2005.
[46] JCSI, Java Cryptographic Secure Implementation, Wedgetail Communications, 2004, http://www.wedgetail.comjcsi/.