Results 171 to 180 of about 1,272 (218)
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 +2 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An improved deniable authentication protocol
Networks, 2006AbstractDeniable 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
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.
Shin-Jia Hwang
exaly +2 more sources
Receiver‐ and sender‐deniable functional encryption [PDF]
IET Information Security, 2018 Deniable encryption, first introduced by Canetti et al. 1997, allows equivocation of encrypted communication. In this work, the authors generalise its study to functional encryption (FE).
Angelo De Caro +2 more
exaly +3 more sources
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014
People sometimes need to communicate directly with one another while concealing the communication itself. Existing systems can allow users to achieve this level of privacy in the wide-area Internet, but parties who are in close proximity (e.g., a public square or coffee shop) may want a lightweight communications channel with similar properties. Today,
Abhinav Narain +2 more
openaire +1 more source
People sometimes need to communicate directly with one another while concealing the communication itself. Existing systems can allow users to achieve this level of privacy in the wide-area Internet, but parties who are in close proximity (e.g., a public square or coffee shop) may want a lightweight communications channel with similar properties. Today,
Abhinav Narain +2 more
openaire +1 more source
On the Deniability of Some Deniable Authentication Protocols
2008 The Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, 2008A 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
The Deniability Analysis for a Deniable Authentication Protocol
Applied Mechanics and Materials, 2012The notion of deniable authentication is introduced by Dwork et al., deniable authentication protocols allow a sender to authenticate a message for receiver, in a way that the receiver cannot convince a third party that such authentication ever took place. Raimondo et al.
Da Wei Wei, Wei Liu, Xiu Feng Zhao
openaire +1 more source
Abuse-Resistant Deniable Encryption
Computer Standards & Interfaces, 2023Deniable encryption (DE) allows private communication over an insecure channel even under the coercion. That is, after an adversary forces communication participants to reveal their secret keys and randomness used during the communication, the message confidentiality can still be preserved. Since its introduction, a large body of studies have been made
Yanmei Cao +4 more
openaire +2 more sources
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society, 2010
Cloud computing provides users with ample computing resources, storage, and bandwidth to meet their computing needs, often at minimal cost. As such services become popular and available to a larger body of users, security mechanisms become an integral part of them.
Paolo Gasti +2 more
openaire +1 more source
Cloud computing provides users with ample computing resources, storage, and bandwidth to meet their computing needs, often at minimal cost. As such services become popular and available to a larger body of users, security mechanisms become an integral part of them.
Paolo Gasti +2 more
openaire +1 more source
On Limitation of Plausible Deniability
2020Recently, a new security definition, named plausible deniability, for synthetic records has been proposed by Bindschaedler et al. Intuitively, the synthetic record r is said to satisfy plausible deniability if there are multiple “original” records that may become r.
Atsushi Waseda, Ryo Nojima
openaire +1 more source