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

New Practical Public-Key Deniable Encryption

Yanmei Cao, Fangguo Zhang, Chongzhi Gao, Xiaofeng Chen

Published Jan 1, 2020• 9 citations
Publisher
DOI
10.1007/978-3-030-61078-4_9

Related papers

Bi-Deniable Public-Key Encryption

Adam O’Neill, Chris Peikert, Brent R. Waters

Lecture notes in computer science•Jan 1, 2011•126 citations

Lower and Upper Bounds for Deniable Public-Key Encryption

Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt +1 more

Lecture notes in computer science•Jan 1, 2011•36 citations

On Minimal Assumptions for Sender-Deniable Public Key Encryption

Dana Dachman-Soled

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

Bi-deniable public-encryption protocols based on standard PKI

Nikolay Andreevich Moldovyan, Березин Андрей Николаевич, А. А. Корниенко +1 more

The paper proposes new deniable encryption protocols providing bi-deniability in the case of both the passive coercive attack and the active one. It is supposed the coercive adversary intercepts all data sent during the protocol. The protocols use no shared secret keys that are pre-agreed by parties of the protocol. Bi-deniability is based on computational indistinguishability between deniable encryption and probabilistic one. Significant merit of the proposed protocols is their using the standard public key infrastructure.

Conference of Open Innovations Association (FRUCT)•Apr 1, 2016•4 citations

Building Key-Private Public-Key Encryption Schemes

Kenneth G. Paterson, Sriramkrishnan Srinivasan

Lecture notes in computer science•Jan 1, 2009•12 citations

Deniable encryption protocols based on probabilistic public-key encryption

Nikolay Andreevich Moldovyan, Березин Андрей Николаевич, А. А. Корниенко +1 more

The paper proposes a new method for designing deniable encryption protocols characterized in using RSA-like probabilistic public-key encryption algorithms. Sender-, receiver-, and bi-deniable protocols are described. To provide bi-deniability in the case of attacks perfored by an active coercer stage of entity authentication is used in one of described protocols.

Conference of Open Innovations Association (FRUCT)•Apr 1, 2017•1 citation
The paper proposes new deniable encryption protocols providing bi-deniability in the case of both the passive coercive attack and the active one. It is supposed the coercive adversary intercepts all data sent during the protocol. The protocols use no shared secret keys that are pre-agreed by parties of the protocol. Bi-deniability is based on computational indistinguishability between deniable encryption and probabilistic one. Significant merit of the proposed protocols is their using the standard public key infrastructure.