ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Off-the-record communication, or, why not to use PGP
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Journal of the ACM (JACM)
Efficient Non-interactive Deniable Authentication Protocols
CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
An efficient deniable authentication protocol
CW '05 Proceedings of the 2005 International Conference on Cyberworlds
Multi-signatures in the plain public-Key model and a general forking lemma
Proceedings of the 13th ACM conference on Computer and communications security
A novel deniable authentication protocol using generalized ElGamal signature scheme
Information Sciences: an International Journal
A New ID-Based Deniable Authentication Protocol
Informatica
A non-interactive deniable authentication scheme based on designated verifier proofs
Information Sciences: an International Journal
An Enhanced Deniable Authentication Protocol
CIS '08 Proceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 01
A Secure and Efficient Deniable Authentication Protocol
ICIE '09 Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02
New Approaches for Deniable Authentication
Journal of Cryptology
ID-Based Non-interactive Deniable Authentication Protocol
IAS '09 Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 01
Non-interactive deniable authentication protocol based on factoring
Computer Standards & Interfaces
Hi-index | 0.00 |
This paper gives a security model for non-interactive deniable authentication (NIDA) protocols. This model captures a session-state-reveal attack and a key-compromise-impersonation attack. We analyze some NIDA protocols in the model, and we find that no one is satisfactory. We give a new paradigm to construct an NIDA protocol, which is provably secure in the model.