nach oben

International Journal of Information Security

Erschienen in:

19.01.2017 | Regular Contribution

Dynamic reversed accumulator

verfasst von: Tsung-Min Kuo, Sung-Ming Yen, Meng-Che Han

Erschienen in: International Journal of Information Security | Ausgabe 2/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Anonymous credential schemes have been widely employed to prove the authenticity of a member by revealing specific member attributes while concealing the real identity from the verifier. Furthermore, an accumulator is used to demonstrate the validity of the credential by providing a corresponding witness. In existing accumulator schemes, all credential holders must update their witnesses when a member joins or is revoked from the system, causing the schemes to become impractical. This paper examines the security of several recent accumulator schemes and proposes a novel approach, the dynamic reversed accumulator, which is more efficient than existing schemes because a corresponding witness can be updated when several members have been revoked.

Vorheriger Artikel Using targeted Bayesian network learning for suspect identification in communication networks

Nächster Artikel Accumulable optimistic fair exchange from verifiably encrypted homomorphic signatures

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Ateniese, G., Tsudik, G.: Quasi-efficient revocation of group signatures. In: Proceedings of the 7th International Conference on Financial Cryptography—FC ’03, LNCS 2357, pp. 183–197. Springer (2003)

Au, M.H., Tsang, P.P., Susilo, W., Mu, Y.: Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems. In: Proceedings of the Cryptographers’ Track at the RSA Conference 2009—CT-RSA ’09, LNCS 5473, pp. 295–308. Springer (2009)

Boneh, D., Boyen, X.: Short signatures without random oracles. In: Advances in Cryptology—EUROCRYPT ’04, LNCS 3027, pp. 56–73. Springer (2004)

Backes, M., Camenisch, J., Sommer, D.: Anonymous yet accountable access control. In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pp. 40–46 (2005)

Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Advances in Cryptology—EUROCRYPT ’93, LNCS 765, pp. 274–285. Springer (1993)

Brands, S., Paquin, C.: U-Prove Cryptographic Specification v1.1 (2013). http://research.microsoft.com/apps/pubs/default.aspx?id=166969

Barić, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Advances in Cryptology—EUROCRYPT ’97, LNCS 1233, pp. 480–494. Springer (1997)

Camenisch, J.: Efficient and generalized group signatures. In: Advances in Cryptology—EUROCRYPT ’97, LNCS 1233, pp. 465–479. Springer (1997)

Camenisch, J., Groß, T.: Efficient attributes for anonymous credentials. ACM Trans. Inf. Syst. Secur. 15(1), 4 (2012). doi:10.1145/2133375.2133379 CrossRef

10.

Camenisch, J., Herreweghen, E.V.: Design and implementation of the idemix anonymous credential system. In: Proceedings of the 9th ACM Conference on Computer and Communications Security—CCS ’02, pp. 21–30 (2002)

11.

Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography—PKC ’09, LNCS 5443, pp. 481–500. Springer (2009)

12.

Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Advances in Cryptology—CRYPTO ’02, LNCS 2442, pp. 61–76. Springer (2002)

13.

Chen, L., Pedersen, T.P.: New group signature schemes. In: Advances in Cryptology—EUROCRYPT ’94, LNCS 950, pp. 171–181. Springer (1995)

14.

Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Advances in Cryptology—CRYPTO ’97, LNCS 1294, pp. 16–30. Springer (1997)

15.

IDEntity MIXer (IDEMIX). http://www.zurich.ibm.com/security/idemix/

16.

Kim, H.J., Lim, J.I., Lee, D.H.: Efficient and secure member deletion in group signature schemes. In: Proceedings of the 3rd International Conference on Information Security and Cryptology—ICISC ’00, LNCS 2015, pp. 150–161. Springer (2001)

17.

Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: Proceedings of the 5th International Conference on Applied Cryptography and Network Security—ACNS ’07, LNCS 4521, pp. 253–269. Springer (2007)

18.

Mashatan, A., Vaudenay, S.: A fully dynamic universal accumulator. Proc. Roman. Acad. 14, 269–285 (2013)MathSciNet

19.

Nguyen, L.: Accumulators from bilinear pairings and applications. In: Proceedings of the Cryptographers’ Track at the RSA Conference 2005—CT-RSA ’05, LNCS 3376, pp. 275–292. Springer (2005)

20.

Song, D.X.: Practical forward secure group signature schemes. In: Proceedings of the 8th ACM Conference on Computer and Communications Security—CCS ’01, pp. 225–234 (2001)

21.

Sander, T., Ta-Shma, A., Yung, M.: Blind, auditable membership proofs. In: Proceedings of the 4th International Conference on Financial Cryptography—FC ’00, LNCS 1962, pp. 53–71. Springer (2001)

Titel: Dynamic reversed accumulator
verfasst von: Tsung-Min Kuo
Sung-Ming Yen
Meng-Che Han
Publikationsdatum: 19.01.2017
Verlag: Springer Berlin Heidelberg
Erschienen in: International Journal of Information Security / Ausgabe 2/2018
Print ISSN: 1615-5262
Elektronische ISSN: 1615-5270
DOI: https://doi.org/10.1007/s10207-017-0360-6

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 2/2018

Using targeted Bayesian network learning for suspect identification in communication networks

Structural analysis and detection of android botnets using machine learning techniques

Accumulable optimistic fair exchange from verifiably encrypted homomorphic signatures

A game-theoretic approach for integrity assurance in resource-bounded systems

HoneyCirculator: distributing credential honeytoken for introspection of web-based attack cycle

A methodology to measure and monitor level of operational effectiveness of a CSOC