Paper 2015/945 Original: eprint.iacr.org/2015/945 ↗

Secure Set-based Policy Checking and Its Application to Password Registration

Changyu Dong
Franziskus Kiefer
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 conflict 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2015-09-28: last updated
2015-09-28: published
Short URL
https://ia.cr/2015/945
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2015/945,
      author = {Changyu Dong and Franziskus Kiefer},
      title = {Secure Set-based Policy Checking and Its Application to Password Registration},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/945},
      year = {2015},
      url = {https://eprint.iacr.org/2015/945}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.