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

Lecture notes in computer science

Composability and On-Line Deniability of Authentication

Yevgeniy Dodis, Jonathan I. Katz, Adam Smith, Shabsi Walfish

Published Jan 1, 2009• 69 citations
Publisher
DOI
10.1007/978-3-642-00457-5_10

Related papers

New Approaches for Deniable Authentication

Mario Di Raimondo, Rosario Gennaro

Journal of Cryptology•May 27, 2009•55 citations

Deniable Authentication on the Internet

Shaoquan Jiang

Lecture notes in computer science•Aug 16, 2008•10 citations

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

Universally Composable Authentication and Key-Exchange with Global PKI

Ran Canetti, Daniel Shahaf, Margarita Vald

Lecture notes in computer science•Jan 1, 2016•52 citations

Universally Composable Security Concurrent Deniable Authentication Based on Witness Indistinguishable

Tao Feng

A new approach and an idea for exploration are presented to the concurrent deniable authentication based on witness-indistinguishable (WI) within the framework of universally composable (UC) security. A definition of an ideal functionality for deniable authentication is formulated. A new deniable authentication protocol is proposed based on two primitives of the verifiably smooth projective Hashing (VSPH) and non-committing encryptions (NCE). This new approach is practically relevant to VSPH based on the Decisional Diffie-Hellman (DDH) assumption and NCE based on the decisional composite residuosity (DCR) assumption. Compared with a timing constraint and public directory model, simulation of the concurrent protocols is not needed to restrict an adversary capability in a common reference string (CRS) model. The protocols are forward deniable and UC security against adaptive adversaries. Unlike previous proposals with the CCA2 public-key cryptosystem or multi-trapdoor commitments paradigm, the new paradigm leads to more efficient protocols.

Journal of Software•Jan 1, 2007•9 citations
A new approach and an idea for exploration are presented to the concurrent deniable authentication based on witness-indistinguishable (WI) within the framework of universally composable (UC) security. A definition of an ideal functionality for deniable authentication is formulated. A new deniable authentication protocol is proposed based on two primitives of the verifiably smooth projective Hashing (VSPH) and non-committing encryptions (NCE). This new approach is practically relevant to VSPH based on the Decisional Diffie-Hellman (DDH) assumption and NCE based on the decisional composite residuosity (DCR) assumption. Compared with a timing constraint and public directory model, simulation of the concurrent protocols is not needed to restrict an adversary capability in a common reference string (CRS) model. The protocols are forward deniable and UC security against adaptive adversaries. Unlike previous proposals with the CCA2 public-key cryptosystem or multi-trapdoor commitments paradigm, the new paradigm leads to more efficient protocols.