A Novel Direct Anonymous Attestation Scheme Using Secure Two-Party Computation - Frontiers in Internet Technologies - page 235

18. Chen, L.: A DAA scheme using batch proof and verification. In: Acquisti, A., Smith,
S.W., Sadeghi, A.-R. (eds.) TRUST 2010. LNCS, vol. 6101, pp. 166-180. Springer,
Heidelberg (2010)
19. Chen, X., Feng, D.: Direct Anonymous Attestation Based on Bilinear maps. Chinese Jour-
nal of Software, China 21(8), 2070-2078 (2010)
20. Brickell, E., Li, J.: A pairing-based DAA scheme furhter reducing TPM resources. In:
Acquisti, A., Smith, S.W., Sadeghi, A.-R. (eds.) TRUST 2010. LNCS, vol. 6101,
pp. 181-195. Springer, Heidelberg (2010)
21. Chen, L.: A DAA scheme requiring less TPM resources. In: Bao, F., Yung, M., Lin, D.,
Jing, J. (eds.) Inscrypt 2009. LNCS, vol. 6151, pp. 350-365. Springer, Heidelberg (2010)
22. Brickell, E., Chen, L., Li, J.: Simplified security notions for direct anonymous attestation
and a concrete scheme from pairings. Int. Journal of Information Security 8, 315-330
(2009)
23. Paillier, P.: Public-key cryptosystems based on composite residuosity classes. In: Stern, J.
(ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
24. Camenisch, J., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Lo-
garithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126-144. Springer,
Heidelberg (2003)
25. Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.)
CRYPTO 2004. LNCS, vol. 3152, pp. 41-55. Springer, Heidelberg (2004)
26. Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers. Discrete Applied Ma-
thematics 156(16), 3113-3121 (2008)
27. Chase, M.: Efficient Non-Interactive Zero-Knowledge Proofs for Privacy Applications.
PhD Thesis, Brown University, pp. 57-67 (2008)
28. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Came-
nisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56-73. Springer, Heidelberg
(2004)
29. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures.
Journal of Cryptology 13(3), 361-396 (2000)
30. Barreto, P.S.L.M., Naehrig, M.: Pairing- friendly elliptic curves of prime order. In:
Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer,
Heidelberg (2006)
31. Brickell, E., Chen, L., Li, J.: A (Corrected) DAA Scheme Using Batch Proof and Verifica-
tion. In: Chen, L., Yung, M., Zhu, L. (eds.) INTRUST 2011. LNCS, vol. 7222,
pp. 304-337. Springer, Heidelberg (2012)