Secure set-based policy checking and its application to password registration

Dong, Changyu and Kiefer, Franziskus; Reiter, Michael and Naccache, David, eds. (2015) Secure set-based policy checking and its application to password registration. In: Cryptology and Network Security. Security and Cryptology . Springer-Verlag Berlin, pp. 59-74. ISBN 978-3-319-26823-1 (https://doi.org/10.1007/978-3-319-26823-1_5)

[thumbnail of Dong-Kiefer-CANS-2015-Secure-set-based-policy-checking-and-its-application-to-password]
Preview
 Text. Filename: Dong_Kiefer_CANS_2015_Secure_set_based_policy_checking_and_its_application_to_password.pdf
Accepted Author Manuscript
Download (496kB)| Preview

Abstract

Policies are the corner stones of today's computer systems. They define secure states and safe operations. A common problem with policies is that their enforcement is often in con ict with user privacy. In order to check the satisfiability of a policy, a server usually needs to collect from a client some information which may be private. In this work we introduce the notion of secure set-based policy checking (SPC) that allows the server to verify policies while preserving the client's privacy. SPC is a generic protocol that can be applied in many policy-based systems. As an example, we show how to use SPC to build a password registration protocol so that a server can check whether a client's password is compliant with its password policy without seeing the password. We also analyse SPC and the password registration protocol and provide security proofs. To demonstrate the practicality of the proposed primitives, we report performance evaluation results based on a prototype implementation of the password registration protocol

ORCID iDs

Dong, Changyu ORCID logoORCID: https://orcid.org/0000-0002-8625-0275 and Kiefer, Franziskus; Reiter, Michael and Naccache, David
CORE (COnnecting REpositories)