Non-interactive Non-malleability from Quantum Supremacy

ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT III, pp. 552-582, 2019.

Cited by: 4|Bibtex|Views59|DOI:https://doi.org/10.1007/978-3-030-26954-8_18
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de

Abstract:

We construct non-interactive non-malleable commitments without setup in the plain model, under well-studied assumptions. First, we construct non-interactive non-malleable commitments w.r.t. commitment for epsilon log log n tags for a small constant epsilon > 0, under the following assumptions: 1. Sub-exponential hardness of factoring or d...More

Code:

Data:

Your rating :
0

 

Tags
Comments