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

Enhanced Trapdoor Hashing from DDH and DCR

Geoffroy Couteau, Aditya Hegde, Sihang Pu

Published Jan 1, 2025• 1 citation
Publisher
DOI
10.1007/978-3-031-91095-1_5

Related papers

Trapdoor Hash Functions and Their Applications

Nico Döttling, Sanjam Garg, Yuval Ishai +3 more

Lecture notes in computer science•Jan 1, 2019•106 citations

Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More

Hoeteck Wee

Lecture notes in computer science•Jan 1, 2012•66 citations

Computationally Succinct Authentication from DCR

Pierre Meyer, Claudio Orlandi, Lawrence Roy +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

DDH-based group key agreement in a mobile environment

Junghyun Nam, Jinwoo Lee, Seungjoo Kim +1 more

Journal of Systems and Software•Dec 9, 2004•59 citations

Improving Practical UC-Secure Commitments Based on the DDH Assumption

Eiichiro Fujisaki

Lecture notes in computer science•Jan 1, 2016•15 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.