Results 101 to 110 of about 307 (148)

Confidential deniable authentication using promised signcryption

Journal of Systems and Software, 2011
In a deniable authentication protocol, a receiver is convinced that a received message is indeed from a particular sender, but cannot prove this to any third party. Deniable authentication protocols satisfy deniability and intended receiver properties.
Shin-Jia Hwang
exaly   +3 more sources

Deniable authentication and key exchange

Proceedings of the 13th ACM conference on Computer and communications security, 2006
We extend the definitional work of Dwork,Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability features of SKEME and SIGMA, two natural and efficient protocols which serve as basis for the Internet Key Exchange (IKE)protocol.SKEME is an encryption-based protocol for which ...
DI RAIMONDO, MARIO, GENNARO R, KRAWCZYK H.   +2 more
core   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

An improved deniable authentication protocol

Networks, 2006
AbstractDeniable authentication, which was introduced to realize secure online negotiation, has been an extensive topic of research. Wang et al. proposed an efficient deniable authentication protocol based on ElGamal cryptography. However, in this article, we show that Wang et al.'s protocol (WLT protocol) is vulnerable to the person‐in‐the‐middle (PIM)
Jun Shao, Zhenfu Cao, Rongxing Lu
exaly   +2 more sources

Notions of Deniable Message Authentication

Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, 2015
Deniable message authentication has drawn significant attention since it was first formalized by Dwork, Naor, and Sahai (STOC 1998). Since then, multiple notions of deniability have been introduced that vary in the considered adversary model and the required level of deniability.
Marc Fischlin, Sogol Mazaheri
openaire   +2 more sources

Deniable authentication protocols

IEE Proceedings: Computers and Digital Techniques, 2001
Two deniable authentication schemes have been developed. One is based on the intractability of the factoring problem, and the other is based on the intractability of the discrete logarithm problem. The computation cost of the first scheme is about (t+2)/2s.
X. Deng, H. Zhu, C.H. Lee
exaly   +2 more sources

Cryptanalysis of a suite of deniable authentication protocols

IEEE Communications Letters, 2006
A deniable authentication protocol allows a sender to transfer an authenticated message to a receiver in such a way that the receiver cannot prove to a third party about the source of the message. In 2001, Deng et al. proposed two deniable authentication protocols under the communication model defined by Aumann and Rabin in 1998. In this paper, we show
Robert W. Zhu, Duncan S. Wong, Chan H. Lee   +2 more
exaly   +2 more sources

An Efficient Deniable Authentication Protocol

2009 International Conference on Management and Service Science, 2009
Source authentication is a research hotspot at the present time. It can be classified as deniable authentication and non-deniable authentication. In recent years, many efficient non-deniable authentication protocols have been proposed. However, much less attention is on the deniable authentication.
Tao Wu, Wen-jun Zhang, Zhen-hua Liu, Cui-xia Mu   +3 more
exaly   +2 more sources

On the Deniability of Some Deniable Authentication Protocols

2008 The Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, 2008
A deniable authentication protocol enables the protocol participants to authenticate their respective peers, while able to deny their participation after the protocol execution. This protocol can be extremely useful in some practical applications such as online negotiation and electronic voting. In 2007, Ma et al.
Meng-Hui Lim, Sanggon Lee, Hoonjae Lee
openaire   +1 more source