SPHF-friendly non-interactive commitments, ASIACRYPT 2013, Part I, pp.214-234, 2013. ,
Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework, CT-RSA 2008, pp.335-351, 2008. ,
DOI : 10.1007/978-3-540-79263-5_22
URL : https://hal.archives-ouvertes.fr/inria-00419157
Smooth projective hashing for conditionally extractable commitments Simple password-based encrypted key exchange protocols, CRYPTO 2009Page 27.) AP05. M. Abdalla and D. Pointcheval CT-RSA 2005, pp.671-689, 2005. ,
DOI : 10.1007/978-3-642-03356-8_39
URL : http://www.di.ens.fr/users/pointche/Documents/Papers/2009_crypto.pdf
Towards human computable passwords. arXiv preprint arXiv:1404.0024v4 Trusted-HB: a low-cost version of HB+ secure against man-in-the-middle attacks HB++: a lightweight authentication protocol secure against some attacks, Security, Privacy and Trust in Pervasive and Ubiquitous Computing, pp.28-33, 2006. ,
Graphical passwords, IEEE Symposium on Security and Privacy 20, and 27.) BN00. M. Bellare and C. Namprempre ASIACRYPT 2000, pp.1-19, 1976. ,
DOI : 10.1145/2333112.2333114
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme, Journal of Cryptology, vol.16, issue.3, pp.185-215, 2003. ,
DOI : 10.1007/s00145-002-0120-1
Authenticated Key Exchange Secure against Dictionary Attacks, EUROCRYPT 2000. (Pages 2, 5, 6, and 8.) BR93, pp.139-155, 2000. ,
DOI : 10.1007/3-540-45539-6_11
URL : http://seclab.cs.ucdavis.edu/papers/Rogaway/dict.pdf
Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993. ,
DOI : 10.1145/168588.168596
Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, pp.67-93, 2000. ,
DOI : 10.1109/sfcs.2001.959888
URL : http://eprint.iacr.org/2000/067.pdf
Universally composable security: A new paradigm for cryptographic protocols (Page 2.) CF01. R. Canetti and M. Fischlin. Universally composable commitments, 42nd FOCS CRYPTO 2001, pp.136-145, 2001. ,
DOI : 10.1109/sfcs.2001.959888
URL : http://eprint.iacr.org/2000/067.pdf
Universally composable password-based key exchange, EUROCRYPT 2005, pp.404-421, 2005. ,
The Random Oracle Model and the Ideal Cipher Model Are Equivalent, CRYPTO 2008, pp.1-20, 2008. ,
DOI : 10.1007/978-3-540-85174-5_1
URL : http://eprint.iacr.org/2008/246.pdf
Déjà vu: A user study using images for authentication, Proceedings of the 9th Conference on USENIX Security Symposium -Volume 9, SSYM'00 USENIX Association. (Page 5.) DS16, pp.4-4, 2000. ,
Indifferentiability of 8-Round Feistel Networks, CRYPTO 2016, Part I, LNCS 9814, pp.95-120, 2016. ,
DOI : 10.1109/SP.1984.10027
How to pair with a human Non-interactive and re-usable universally composable string commitments with adaptive security, SCN 10 ASIACRYPT 2011, pp.200-218, 2010. ,
On the Complexity of Random Satisfiability Problems with Planted Solutions, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15, pp.77-86, 2015. ,
DOI : 10.1080/01621459.1987.10478458
On the Complexity of Random Satisfiability Problems with Planted Solutions, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15, pp.77-86 ,
DOI : 10.1080/01621459.1987.10478458
Inc. https://support.google.com/accounts/answer/1066447?hl=en&rd=1 ,
The s/key one-time password system. RFC 1760, IETF http://tools.ietf. org/html/rfc1760 Secure human identification protocols, ASIACRYPT 2001, pp.52-66, 1995. ,
The equivalence of the random oracle model and the ideal cipher model, revisited, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.89-98, 2011. ,
DOI : 10.1145/1993636.1993650
A one-time password system. RFC 2289, IETF, 1998. ,
DOI : 10.17487/rfc1938
The design and analysis of graphical passwords Authenticating pervasive devices with human protocols (Page 5.) Kho14. K. A. Khoureich. hHB: a harder HB+ protocol. Cryptology ePrint Archive Light-hHB: A new version of hHB with improved session key exchange An application of visual secret sharing scheme concealing plural secret images to human identification scheme Human-machine identification using visual cryptography, Proceedings of the 8th Conference on USENIX Security Symposium CRYPTO 2005 Proc. of SITA Proceedings of the 6th IEEE International Workshop on Intelligent Signal Processing and Communication SystemsPage 5.) LMM08. X. Leng, K. Mayes, and K. Markantonakis. HB-MP+ protocol: An improvement on the HB-MP protocol. In RFID IEEE International Conference onPage 5.) LT99. X.-Y. Li and S.-H. Teng. Practical human-machine identification over insecure channels, pp.1-1, 1996. ,
Human-computer cryptography: An attempt, ACM CCS 96, pp.68-75, 1996. ,
DOI : 10.3233/jcs-980076
HOTP: An HMAC-based one-time password algorithm. RFC 4226, IETF Human identification through insecure channel, EUROCRYPT'91, pp.409-421, 1991. ,
TOTP: Time-based one-time password algorithm, RFC, vol.6238, pp.6238-6243, 2011. ,
HB-MP: A further step in the HB-family of lightweight authentication protocols, ACISP 10, pp.2262-2267, 2007. ,
DOI : 10.1016/j.comnet.2007.01.011
OCB: A block-cipher mode of operation for efficient authenticated encryption (Page 13.) RSA. RSA SecurId Hardware Tokens. RSA Security. https://www.rsa.com/en-us/products-services/ identity-access-management/securid/hardware-tokens. (Pages 5, 12, and 21.) TvO04. J. Thorpe and P. C. van Oorschot. Graphical dictionaries and the memorable space of graphical passwords, ACM CCS 01 Proceedings of the 13th USENIX Security Symposium, pp.196-205, 2001. ,