PriSign, A Privacy-Preserving Single Sign-On System for Cloud Environments
Source abstract
Abstract
Anonymous single sign-on systems allow users to use a single credential to access multiple services protected by verifiers without revealing their personal information, which is especially important due to privacy regulations such as GDPR. In this paper, we introduce a new strong privacy-preserving single sign-on scheme, dubbed PriSign, based on our proposed attribute-based credential with traceability (ABCT), attribute-based credential with blindness (ABCB), and threshold inner-product functional encryption (TIPFE). Compared with the existing state-of-the-art solutions, PriSign presents three improvements: (1) users can obtain different types of tickets according to the attribute disclosure policies enforced by the ticket issuer to support fine-grained access control; (2) users can hide access tokens and designate a verifier for tokens according to a verifier’s policy jointly issued by multiple policymakers, meaning that non-designated verifiers cannot obtain any information about the tokens; (3) we innovatively use a threshold approach to issue policy keys online in order for verifiers to achieve proxy re-verification services in an unstable cloud environment. We implement PriSign and compare the performance with other ASSO systems in the personal laptop, and the results prove its practicability.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security · Privacy-Preserving Technologies in Data · Cloud Data Security Solutions
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China
Beijing Electronic Science and Technology Institute, Beijing 100070, China
School of Computing and Information Systems, Singapore Management University, Singapore 188065, Singapore
Funding
National Key Research and Development Program of China · National Natural Science Foundation of China
References (42)
Show source-provided references
1. Recordon, D., and Reed, D. (2006, January 3). OpenID 2.0: A platform for user-centric identity management. Proceedings of the Second ACM Workshop on Digital Identity Management, Alexandria, VA, USA.10.1145/1179529.1179532 ↗
2. (2022, November 20). MIT Kerberos: Kerberos: The Network Authentication Protocol. Available online: https://web.mit.edu/kerberos/.
3. European Union (2016). General data protection regulation. Off. J. Eur. Union, 49, L119. Available online: https://gdpr-info.eu.
4. Anonymous authentication for mobile single sign-on to protect user privacy10.1504/IJMC.2008.019824 ↗
5. Han, J., Mu, Y., Susilo, W., and Yan, J. (2010, January 7–9). A generic construction of dynamic single sign-on with strong security. Proceedings of the International Conference on Security and Privacy in Communication Systems, Singapore.10.1007/978-3-642-16161-2_11 ↗
6. Wang, J., Wang, G., and Susilo, W. (2013, January 9–11). Anonymous single sign-on schemes transformed from group signatures. Proceedings of the 2013 5th International Conference on Intelligent Networking and Collaborative Systems, IEEE, Xi’an, China.10.1109/INCoS.2013.104 ↗
7. Provably secure anonymous single-sign-on authentication mechanisms using extended Chebyshev chaotic maps for distributed computer networks10.1109/JSYST.2015.2471095 ↗
8. Han, J., Chen, L., Schneider, S., Treharne, H., and Wesemeyer, S. (2018, January 3–7). Anonymous single-sign-on for n designated services with traceability. Proceedings of the European Symposium on Research in Computer Security, Barcelona, Spain.10.1007/978-3-319-99073-6_23 ↗
9. Anonymous single sign-on with proxy re-verification10.1109/TIFS.2019.2919926 ↗
10. (2022, November 20). PriSign [Online]. Available online: https://github.com/PriSign/PriSign.
11. Boneh, D., and Waters, B. (November, January 30). A fully collusion resistant broadcast, trace, and revoke system. Proceedings of the 13th ACM Conference on Computer and Communications Security, Alexandria, VA, USA.
12. Dodis, Y., and Fazio, N. (2003, January 6–8). Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. Proceedings of the International Workshop on Public Key Cryptography, Miami, FL, USA.10.1007/3-540-36288-6_8 ↗
13. Boneh, D., Shen, E., and Waters, B. (2006, January 24–26). Strongly unforgeable signatures based on computational Diffie-Hellman. Proceedings of the International Workshop on Public Key Cryptography, New York, NY, USA.10.1007/11745853_15 ↗
14. A digital signature scheme secure against adaptive chosen-message attacks10.1137/0217017 ↗
15. Zero-knowledge proofs of identity10.1007/BF02351717 ↗
16. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems10.1145/116825.116852 ↗
17. Bellare, M., Shi, H., and Zhang, C. (2005, January 14–18). Foundations of group signatures: The case of dynamic groups. Proceedings of the Cryptographers’ Track at the RSA Conference, San Francisco, CA, USA.
18. Nguyen, L., and Safavi-Naini, R. (2004, January 5–9). Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea.10.1007/978-3-540-30539-2_26 ↗
19. Security of public-key cryptosystems based on Chebyshev polynomials10.1109/TCSI.2005.851701 ↗
20. Using time-stamp to improve the security of a chaotic maps-based key agreement protocol10.1016/j.ins.2007.11.001 ↗
21. Au, M.H., Susilo, W., and Mu, Y. (2006, January 6–8). Constant-size dynamic k-TAA. Proceedings of the International Conference on Security and Cryptography for Networks, Maiori, Italy.10.1007/11832072_8 ↗
22. Camenisch, J., Kiayias, A., and Yung, M. (2009, January 26–30). On the portability of generalized schnorr proofs. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany.10.1007/978-3-642-01001-9_25 ↗
23. Boneh, D., and Franklin, M. (2001, January 19–23). Identity-based encryption from the Weil pairing. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.10.1007/3-540-44647-8_13 ↗
24. On cryptographic protocols employing asymmetric pairings—The role of Ψ revisited10.1016/j.dam.2011.04.021 ↗
25. Privacy-preserving electronic ticket scheme with attribute-based credentials
26. Efficient strong privacy protection and transferable attribute-based ticket scheme
27. Privacy-preserving attribute ticket scheme based on mobile terminal with smart card
28. Boneh, D., and Boyen, X. (2004, January 2–6). Short signatures without random oracles. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland.10.1007/978-3-540-24676-3_4 ↗
29. Camenisch, J., Chaabouni, R., and Shelat, A. (2008, January 7–11). Efficient protocols for set membership and range proofs. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT’08), Melbourne, Australia.10.1007/978-3-540-89255-7_15 ↗
30. Structure-preserving signatures on equivalence classes and constant-size anonymous credentials10.1007/s00145-018-9281-4 ↗
31. Blömer, J., and Bobolz, J. (2018, January 2–4). Delegatable attribute-based anonymous credentials from dynamically malleable signatures. Proceedings of the International Conference on Applied Cryptography and Network Security, Leuven, Belgium.10.1007/978-3-319-93387-0_12 ↗
32. Pairings for cryptographers10.1016/j.dam.2007.12.010 ↗
33. Groth, J. (December, January 29). Efficient fully structure-preserving signatures for large messages. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand.
34. Sako, K. (2016). Short Randomizable Signatures. Topics in Cryptology—CT-RSA 2016, Springer. Lecture Notes in Computer Science.10.1007/978-3-319-29485-8 ↗
35. Do, X.T., Phan, D.H., and Pointcheval, D. (2020, January 24–28). Traceable inner product functional encryption. Proceedings of the Cryptographers’ Track at the RSA Conference, San Francisco, CA, USA.10.1007/978-3-030-40186-3_24 ↗
36. Katz, J., Sahai, A., and Waters, B. (2008, January 13–17). Predicate encryption supporting disjunctions, polynomial equations, and inner products. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey.
37. Chase, M., and Lysyanskaya, A. (2006, January 20–24). On signatures of knowledge. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.
38. Sonnino, A., Al-Bassam, M., Bano, S., Meiklejohn, S., and Danezis, G. (2018). Coconut: Threshold issuance selective disclosure credentials with applications to distributed ledgers. arXiv.10.14722/ndss.2019.23272 ↗
39. NIST (2022, November 20). Advanced Encryption Standard (AES), Available online: http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf.
40. NIST (2022, November 20). Recommendation for Block Cipher Modes of Operation (Meth-ods and Techniques), Available online: http://csrc.nist.gov/publications/nistpubs/800-38a/sp800-38a.pdf.
41. MIRACL Ltd (2022, November 20). Available online: https://github.com/miracl/MIRACL.
42. Fan, J., Vercauteren, F., and Verbauwhede, I. (2009, January 6–9). Faster Fp-Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves. Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems, Lausanne, Switzerland.10.1007/978-3-642-04138-9_18 ↗