Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Efficient blacklistable anonymous credential system with reputation using a pairing-based accumulator

© The Institution of Engineering and Technology
Received 28/09/2018, Accepted 16/03/2020, Revised 22/11/2019, Published 17/03/2020

As privacy-enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems with reputation have been proposed. However, the previous systems have the efficiency problem: The authentication data size is or , where L is the reputation list, and K is the size of a window indicating the most recent K authentications of the user. Therefore, the previous systems suffer from or -size data in each authentication. In addition, the authentication needs the computation of or exponentiations. In this paper, an efficient blacklistable anonymous credential system with reputation is proposed. In our system, the data size of the authentication is . Furthermore, although the computational costs in the authentication depend on some parameters, the parameter-related costs are only multiplications instead of exponentiations. Compared to the previously proposed blacklistable system FARB with the constant computational and communication costs, our system has the advantage that the clear/redeem protocol only has to be executed every interval instead of every session. For constructing our system, we newly introduce the concept of an accumulator for reputation, and propose an efficient construction.

Inspec keywords: cryptographic protocols

Other keywords: privacy-enhancing authentications; efficient blacklistable anonymous credential system; clear-redeem protocol; blacklistable system FARB; K authentications; authentication data size; exponentiations

Subjects: Cryptography; Data security; Protocols; Cryptography theory

References

    1. 1)
      • 4. Aikou, Y., Sadiah, S., Nakanishi, T.: ‘An efficient blacklistable anonymous credentials without TTPs using pairing-based accumulator’. Proc. 31st IEEE Int. Conf. on Advanced Information Networking and Applications (AINA 2017), Taipei, Taiwan, 2017, pp. 780–786.
    2. 2)
      • 3. Yu, K.Y., Yuen, T.H., Chow, S.S., et al: ‘PE(AR)2: privacy-enhanced anonymous authentication with reputation and revocation’. Proc. European Symp. on Research in Computer Security (ESORICS 2012), Pisa, Italy, 2012 (LNCS, 7459), pp. 679–696.
    3. 3)
      • 8. Au, M.H., Kapadia, A.: ‘PERM: practical reputation-based blacklisting without TTPs’. Proc. 2012 ACM Conf. on Computer and communications security (ACM-CCS 2012), Raleigh, NC, USA, 2012, pp. 929–940.
    4. 4)
      • 12. Camenisch, J., Kohlweiss, M., Soriente, C.: ‘An accumulator based on bilinear maps and efficient revocation for anonymous credentials’. Proc. 12th Int. Conf. on Practice and Theory in Public Key Cryptography (PKC 2009), Irvine, CA, USA, 2009 (LNCS, 5443), pp. 481–500.
    5. 5)
      • 17. Camenisch, J., Chaabouni, R., Shelat, A.: ‘Efficient protocols for set membership and range proofs’. Advances in Cryptology, ASIACRYPT 2008, Melbourne, Australia, 2008 (LNCS, 5350), pp. 234–252.
    6. 6)
      • 11. Abe, M., Haralambiev, K., Ohkubo, M..: ‘Signing on elements in bilinear groups for modular protocol design’. Report 2010/133, Cryptology ePrint Archive, 2010.
    7. 7)
      • 13. Boneh, D., Boyen, X., Shacham, H.: ‘Short group signatures’. Advances in Cryptology – CRYPTO 2004, Santa Barbara, CA, USA, 2004 (LNCS, 3152), pp. 41–55.
    8. 8)
      • 16. Nakanishi, T., Funabiki, N.: ‘An anonymous reputation system with reputation secrecy for manager’, IEICE Trans. Fundam., 2014, 97-A, (12), pp. 2325–2335.
    9. 9)
      • 10. Nakanishi, T., Kanatani, T.: ‘An efficient blacklistable anonymous credential system with reputation using pairing-based accumulator’. Proc. 17th IEEE Int. Conf. on Trust, Security and Privacy in Computing and Communications (TrustCom 2018), New York, NY, USA, 2018, pp. 1140–1148.
    10. 10)
      • 7. Au, M.H., Kapadia, A., Susilo, W.: ‘BLACR: TTP-free blacklistable anonymous credentials with reputation’. Proc. 19th Annual Network and Distributed System Security Symp. (NDSS 2012), San Diego, CA, USA, 2012.
    11. 11)
      • 5. Tsang, P.P., Au, M.H., Kapadia, A., et al: ‘BLAC: revoking repeatedly misbehaving anonymous users without relying on TTPs’, ACM Trans. Inf. Syst. Secur., 2010, 13, (4), pp. 39:1–39:33.
    12. 12)
      • 9. Xi, L., Feng, D.: ‘FARB: fast anonymous reputation-based blacklisting without TTPs’. Proc. 13th Workshop on Privacy in the Electronic Society (WPES 2014), Scottsdale, AZ, USA, 2014, pp. 139–148.
    13. 13)
      • 6. Au, M.H., Tsang, P.P., Kapadia, A.: ‘PEREA: practical TTP-free revocation of repeatedly misbehaving anonymous users’, ACM Trans. Inf. Syst. Secur., 2011, 14, (4), pp. 29:1–29:34.
    14. 14)
      • 2. Tsang, P.P., Au, M.H., Kapadia, A., et al: ‘PEREA: towards practical TTP-free revocation in anonymous authentication’. Proc. ACM Conf. on Computer and Communications Security (ACM-CCS'08), Alexandria, VA, USA, 2008, pp. 333–344.
    15. 15)
      • 15. Sudarsono, A., Nakanishi, T., Funabiki, N.: ‘Efficient proofs of attributes in pairing-based anonymous credential system’. Proc. 11th Privacy Enhancing Technologies Symp. (PETS 2011), Waterloo, ON, Canada, 2011 (LNCS, 6794), pp. 246–263.
    16. 16)
      • 14. Pedersen, T.P.: ‘Non-interactive and information-theoretic secure verifiable secret sharing’. Advances in Cryptology (CRYPTO'91), Santa Barbara, CA, USA, 1992 (LNCS, 576), pp. 129–140.
    17. 17)
      • 1. Tsang, P.P., Au, M.H., Kapadia, A., et al: ‘Blacklistable anonymous credentials: blocking misbehaving users without TPPs’. Proc. ACM Conf. on Computer and Communications Security 2007 (ACM-CCS'07), Alexandria, VA, USA, 2007, pp. 72–81.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2018.5505
Loading

Related content

content/journals/10.1049/iet-ifs.2018.5505
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address