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

Public Verifiability in the Covert Model (Almost) for Free

Vladimir Kolesnikov, Alex J. Malozemoff

Published Jan 1, 2015• 24 citations
Publisher
DOI
10.1007/978-3-662-48800-3_9

Related papers

Covert Security with Public Verifiability: Faster, Leaner, and Simpler

Hong Cheng, Jonathan I. Katz, Vladimir Kolesnikov +2 more

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

Calling Out Cheaters: Covert Security with Public Verifiability

Gilad Asharov, Claudio Orlandi

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

Black-Box Transformations from Passive to Covert Security with Public Verifiability

Ivan Damgård, Claudio Orlandi, Mark Simkin

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

Publicly verifiable covert two-party computation with punitive blame

Chuan Zhao, Jun Xu, Shengnan Zhao +3 more

Computer Standards & Interfaces•Jan 17, 2026•0 citations

Robust Publicly Verifiable Covert Security: Limited Information Leakage and Guaranteed Correctness with Low Overhead

Yi Liu, Junzuo Lai, Qi Wang +3 more

Lecture notes in computer science•Jan 1, 2023•4 citations

Generic Compiler for Publicly Verifiable Covert Multi-Party Computation

Sebastian Faust, Carmit Hazay, David Kretzler +1 more

Lecture notes in computer science•Jan 1, 2021•14 citations