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

Round Optimal Concurrent Non-malleability from Polynomial Hardness

Dakshita Khurana

Published Jan 1, 2017• 31 citations
Publisher
DOI
10.1007/978-3-319-70503-3_5

Related papers

Concurrent Security and Non-malleability

Rafael Pass

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

A New Construction of Concurrent Non-malleable Zero-Knowledge

Rui Li, Qiuliang Xu

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

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs

Huijia Lin, Rafael Pass

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

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

Round Optimal Concurrent MPC via Strong Simulation

Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain +2 more

Lecture notes in computer science•Jan 1, 2017•24 citations

On Round-Efficient Non-Malleable Protocols.

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

•Jan 1, 2016•2 citations