Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computers & Security

Privacy-oriented dependency via deniable SIGMA protocol

Łukasz Krzywiecki, Kamil Kluczniak, Patryk Kozieł, Nisha Panwar

Published Aug 22, 2018• 6 citations
Publisher
DOI
10.1016/j.cose.2018.08.002

Related papers

Robust Deniable Authentication Protocol

Eun‐Jun Yoon, Kee-Young Yoo, Sang-Soo Yeo +1 more

Wireless Personal Communications•Jul 29, 2009•13 citations

Quantum deniable authentication protocol

Wei‐Min Shi, Yi‐Hua Zhou, Yu‐Guang Yang

Quantum Information Processing•Mar 16, 2014•23 citations

Privacy in Non-private Environments

Markus Bläser, Andreas Jakoby, Maciej Liśkiewicz +1 more

Lecture notes in computer science•Jan 1, 2004•5 citations

Deniable Internet Key-Exchange.

Andrew Chi-Chih Yao, Frances Yao, Yunlei Zhao +1 more

In this work, we develop a family of protocols for deniable Internet Key-Exchange (IKE) with the following properties: • Highly practical efficiency, and conceptual simplicity and clarity. • Forward and concurrent (non-malleable) deniability against adversaries with arbitrary auxiliary inputs, and better privacy protection of players ’ roles. • Provable security in the Canetti-Krawczyk post-specified-peer model, and maintenance of essential security properties not captured by the Canetti-Krawczyk security model. • Compatibility with the widely deployed and standardized SIGMA (i.e., the basis of IKEv2) and (H)MQV protocols, when parties possess DL public-keys. Our protocols could potentially serve, in part, as either the underlying basis or a useful alternative for the next generation of IKE (i.e., IKEv3) of IPsec (in particular, when deniability is desired). In view of the wide deployment and use of IKE and increasing awareness of privacy protection (especially for E-commerce over Internet), this work is naturally of practical interest.

•Jan 1, 2007•9 citations

Privacy in Non-Private Environments

Markus Bläser, Andreas Jakoby, Maciej Liśkiewicz +1 more

Electronic colloquium on computational complexity•Jan 1, 2003•0 citations

An efficient non-interactive deniable authentication protocol with anonymous sender protection

Shin‐Jia Hwang, Chien-Hung Chao

Deniable authentication protocols satisfy two basic properties: Deniability and the specifiable receiver properties. However, the deniability also damages the sender right. To protect senders, Hwang and Ma first proposed deniable authentication with anonymous sender protection. The sender’s anonymity is also used to protect the sender’s privacy. To reduce the computation cost, an efficient deniable authentication protocol is proposed. Our new protocol not only achieves the two properties but also provides the protection of sender and receiver to keep the privacy of the sender and receiver. Though the sent message is forgeable by receivers, but the sender can provide evidence to prove the message was really sent by him/her. Due to the efficient performance, our protocol is more practical than the other protocols in the real world.

Journal of Discrete Mathematical Sciences and Cryptography•Jun 1, 2010•7 citations
In this work, we develop a family of protocols for deniable Internet Key-Exchange (IKE) with the following properties: • Highly practical efficiency, and conceptual simplicity and clarity. • Forward and concurrent (non-malleable) deniability against adversaries with arbitrary auxiliary inputs, and better privacy protection of players ’ roles. • Provable security in the Canetti-Krawczyk post-specified-peer model, and maintenance of essential security properties not captured by the Canetti-Krawczyk security model. • Compatibility with the widely deployed and standardized SIGMA (i.e., the basis of IKEv2) and (H)MQV protocols, when parties possess DL public-keys. Our protocols could potentially serve, in part, as either the underlying basis or a useful alternative for the next generation of IKE (i.e., IKEv3) of IPsec (in particular, when deniability is desired). In view of the wide deployment and use of IKE and increasing awareness of privacy protection (especially for E-commerce over Internet), this work is naturally of practical interest.
Deniable authentication protocols satisfy two basic properties: Deniability and the specifiable receiver properties. However, the deniability also damages the sender right. To protect senders, Hwang and Ma first proposed deniable authentication with anonymous sender protection. The sender’s anonymity is also used to protect the sender’s privacy. To reduce the computation cost, an efficient deniable authentication protocol is proposed. Our new protocol not only achieves the two properties but also provides the protection of sender and receiver to keep the privacy of the sender and receiver. Though the sent message is forgeable by receivers, but the sender can provide evidence to prove the message was really sent by him/her. Due to the efficient performance, our protocol is more practical than the other protocols in the real world.