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

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications

Jonathan I. Katz

Published Jan 1, 2003• 45 citations
Publisher
DOI
10.1007/3-540-39200-9_13

Related papers

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications (Extended Abstract)

Jonathan I. Katz

•Jan 1, 2003•1 citation

Concurrent Non-Malleable Zero Knowledge Proofs

Huijia Lin, Rafael Pass, Wei-Lung Dustin Tseng +1 more

Lecture notes in computer science•Jan 1, 2010•35 citations

Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge

Keita Xagawa, Keisuke Tanaka

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

Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead

Steven Myers, Mona Sergi, Abhi A. Shelat

Lecture notes in computer science•Jan 1, 2013•3 citations

Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem

Shafi Goldwasser, Dmitriy Kharchenko

Lecture notes in computer science•Jan 1, 2005•22 citations

A New Construction of Concurrent Non-malleable Zero-Knowledge

Rui Li, Qiuliang Xu

Chinese Journal of Computers•Nov 16, 2012•0 citations