We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovs...
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...