Non-black-box Simulation in the Fully Concurrent Setting, Revisited, by Susumu Kiyoshima

Published: 15/03/2019
Non-black-box Simulation in the Fully Concurrent Setting, Revisited, by Susumu Kiyoshima
Source: EPRINT.IACR.ORG

We give a new proof of the existence of $O(n^{\epsilon})$-round public-coin concurrent zero-knowledge arguments for NP, where $\epsilon>0$ is an arbitrary constant. The security is proven in the plain model under the assumption that collision-resistant hash functions exist. (The existence of such concurrent zero-knowledge arguments was previously proven by Goyal (STOC'13) in the plain model und

Read more
Related news
Comment
Latest in blog
FACEBOOK