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

Computationally Succinct Authentication from DCR

Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-25317-0_11

Related papers

Succinct Non-interactive Secure Computation

Andrew Morgan, Rafael Pass, Antigoni Polychroniadou

Lecture notes in computer science•Jan 1, 2020•10 citations

Simultaneous-Message and Succinct Secure Computation

Elette Boyle, Abhishek Jain, Sacha Servan-Schreiber +1 more

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

Enhanced Trapdoor Hashing from DDH and DCR

Geoffroy Couteau, Aditya Hegde, Sihang Pu

Lecture notes in computer science•Jan 1, 2025•1 citation

Practical Covert Authentication

Stanisław Jarecki

Lecture notes in computer science•Jan 1, 2014•10 citations

Identity-Based Authenticated Key Agreement Protocols without Bilinear Pairing in Multiple PKG Environments

Junquan Li

The authors present an identity-based authenticated key agreement protocol without bilinear pairing in multiple PKG environments.Reduced to the standard computational Diffie-Hellman(CDH) assumption in the random oracle model,the protocol security is given a complete proof based on the security of proposed ID-based exponential challenge-response(XCR) signature scheme and dual challenge-response(DCR) signature scheme.Compared with previous identity-based authenticated key agreement protocols,the new protocol shows better performances.

Beijing Daxue Xuebao. Zirankexueban•Jan 1, 2012•0 citations

A Zero-Knowledge Identification and Key Agreement Protocol.

Douglas R. Stinson, Jiang Wu

In this paper, we propose a zero-knowledge authenticated key agreement protocol with key confirmation (AKC) in asymmetric setting. The protocol has several desirable security attributes like some classical AKCs such as STS [7] and MQV [13]. One highlight of our protocol is its zero-knowledge property, which enables succinct proofs of the claimed security attributes, while the overhead in communication and computation resulting from the special design to achieve zero-knowledge is insignificant.

•Jan 1, 2007•5 citations
The authors present an identity-based authenticated key agreement protocol without bilinear pairing in multiple PKG environments.Reduced to the standard computational Diffie-Hellman(CDH) assumption in the random oracle model,the protocol security is given a complete proof based on the security of proposed ID-based exponential challenge-response(XCR) signature scheme and dual challenge-response(DCR) signature scheme.Compared with previous identity-based authenticated key agreement protocols,the new protocol shows better performances.