Zero-Knowledge Authentication

@article{Povsic2021ZeroKnowledgeA,
  title={Zero-Knowledge Authentication},
  author={Jakob Povsic and Andrej Brodnik},
  journal={ArXiv},
  year={2021},
  volume={abs/2205.05847}
}
Zero-Knowledge proofs (ZKPs) enable proving of mathematical statements, revealing nothing but their validity. We design an authentication sys-tem with a ZKP as a password verification mech-anism within the Extensible Authentication Pro-tocol (EAP) framework. Designing a secure pass-word authentication system requires us to adopt security practices for protecting ourselves against the vulnerabilities of passwords. Integrating said practices is not trivial because of the tight cou-pling with the… 
[PDF] Semantic Reader
1 Citations

Figures and Tables from this paper

One Citation

Anonymity Preserving Secure Authentication for a Transparent Internet Voting Process

  • Khan Farhan Rafat
  • Computer Science
    2022 International Conference on Cyber Warfare and Security (ICCWS)
  • 2022
This research focuses on the security aspects of the authentication mechanisms used in the i-voting System of Estonia, and proposes a proposed digital authentication mechanism, which ensures the anonymity of both the ballot and the voter and is a novel contribution to date.

References

SHOWING 1-10 OF 10 REFERENCES

How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design

Under the assumption that encryption functions exist, we show that all languages in NP possess zero-knowledge proofs. That is, it is possible to demonstrate that a CNF formula is satisfiable without…

On the Composition of Zero-Knowledge Proof Systems

It is proved that three-round interactive proofs and constant-round Arthur--Merlin proofs that are black-box simulation zero-knowledge exist only for languages in BPP, and it follows that the "parallel versions" of the first interactive proofs systems presented for quadratic residuosity, graph isomorphism, and any language in NP, are not black- box simulationzero-knowledge, unless the corresponding languages are in B PP.

On the Economics of Offline Password Cracking

It is advocated that password hashing standards should be updated to require the use of memory hard functions for password hashing and disallow the useof non-memory hard functions such as BCRYPT or PBKDF2.

Foundations of Cryptography: Volume 1, Basic Tools

It's coming again, the new collection that this site has, and the favorite foundations of cryptography volume 1 basic tools vol 1 book is offered as the choice today.

The knowledge complexity of interactive proof-systems

A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.

PPP EAP SRP-SHA1 Authentication Protocol

Extensible Authentication Protocol (EAP)

Salted password hashing-doing it right

  • 2016

NIST Special Publication 800-63-3 Digital Identity Guidelines

  • National Institute of Standards and Technology,
  • 2017

Salted password hashing-doing it right, 2016

  • 2016