Strong accumulators from collision-resistant hashing

International Journal of Information Security

Volumn 11, Issue 5, 2012, Pages 349-363

  Camacho, Philippe ^a   Hevia, Alejandro ^a   Kiwi, Marcos ^a   Opazo, Roberto ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b CEO khipucom   (Chile)

Author keywords

Collision resistant hashing; e invoice; Strong accumulators

Indexed keywords

APPLIED CRYPTOGRAPHY; COLLISION-RESISTANT HASH FUNCTIONS; COLLISION-RESISTANT HASHING; E-INVOICE; FACTORING PROBLEM; PROVABLY SECURE; SECURITY REQUIREMENTS; STRONG ACCUMULATORS;

HASH FUNCTIONS; MANAGEMENT; NETWORK SECURITY;

MANAGERS;

EID: 84866485848     PISSN: 16155262     EISSN: 16155270     Source Type: Journal    
DOI: 10.1007/s10207-012-0169-2     Document Type: Article

References (20)

1. Asociación Chilena de Factoring (ACHEF). Estadísticas. http://www. achef. cl/ [June 28, 2011]).
2. Barić, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signed scheme without trees. In: Advances in Cryptology-Proceedings of Eurocrypt '97, vol. 1233 of LNCS, pp. 480-494, Springer (1997).
3. Bayer, D., Haber, S., Stornetta W. S.: Improving the efficiency and reliability of digital time-stamping. In: Sequences II: Methods in Communication, Security, and Computer Science, pp. 329-334. Springer (1993).
4. Benaloh, J., De Mare M.: One-way accumulators: a decentralized alternative to digital signatures. In: Advances in Cryptology-Proceedings of Eurocrypt '93, vol. 765 of LNCS, pp. 274-285. Springer (1993).
5. Boneh, D., Venkatesan R.: Breaking RSA may not be equivalent to factoring. In: Advances in Cryptology-Proceedings of Eurocrypt '98, vol. 1233 of LNCS, pp. 59-71. Springer (1998).
6. Canetti, R., Micciancio, D., Reingold O.: Perfectly one-way probabilistic hash functions. In: 30th Annual Symposium on the Theory of Computing, pp. 131-140, ACM Press (1998).
7. Camenisch, J., Lysyanskaya A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Advances in Cryptology-Proceedings of Crypto '02, volume 2442 of LNCS, pp. 61-76, Springer (2002).
8. Cramer R., Gennaro R., Schoenmakers B.: A secure and optimally efficient multi-authority election scheme. In: Advances in Cryptology-Proceedings of Eurocrypt '97, vol. 1233 of LNCS, pp. 103-118. Springer (1997).
9. Damgård, I.: Collision free hash functions and public key signature schemes. In: Advances in Cryptology, Proceedings of Eurocrypt '87, vol. 308 of LNCS, pp. 203-216. Springer (1988).
10. Fazio, N., Nicolisi, A.: Cryptographic accumulators: Definitions, constructions and applications, 2003. http://www. cs. nyu. edu/~nicolosi/papers/accumulators. ps [June 19, 2008]).
11. Hurd W. H.: Four centuries of factoring. Q. J. Econ. 53(2), 305-311 (1939).
12. International Factors Group (IFG). http://www. ifgroup. com/ [June 28, 2011]).
13. Kate, A., Goldberg I.: Distributed key generation for the internet. In: 29th IEEE International Conference on Distributed Computing Systems, June, pp. 119-128, IEEE Press (2009).
14. Kocher, P. C.: On certificate revocation and validation. In: Financial Cryptography, vol. 1465 of LNCS, pp. 172-177. Springer (1998).
15. Li, J., Li, N., Xue R.: Universal accumulators with efficient nonmembership proofs. In: Proceedings of Applied Cryptography and Network Security-ACNS '07, vol. 4521 of LNCS (2007).
16. National Institute of Standards and Technology (NIST). FIPS Publication 180: Secure Hash Standard (SHS), (May 1993).
17. OpenSSL Project. OpenSSL Package, June 2008. http://www. openssl. org [June 19, 2008]).
18. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: 21st Annual Symposium on the Theory of Computing, pp. 73-85, ACM Press (1989).
19. Rogaway, P.: Formalizing Human Ignorance. In: Progress in Cryptology-Proceedings of Vietcrypt '06, vol. 4341 of LNCS, pp. 211-228. Springer (2006).
20. Servicio de Impuestos Internos. Información sobre factura electrónica. (https://palena. sii. cl/dte/menu. html [June 24, 2011]).