Non-interactive non-malleability from quantum supremacy

DOI10.1007/978-3-030-26954-8_18OpenAlexW2968979183MaRDI QIDQ2304932

Yael Tauman Kalai, Dakshita Khurana

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_18

Mathematics Subject Classification ID

Computational learning theory (68Q32) Cryptography (94A60) Error probability in coding theory (94B70) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (12)

Non-malleable codes for bounded parallel-time tampering ⋮ COA-secure obfuscation and applications ⋮ Non-malleable commitments against quantum attacks ⋮ Maliciously-secure MrNISC in the plain model ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Non-malleable time-lock puzzles and applications ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ On the CCA compatibility of public-key infrastructure

This page was built for publication: Non-interactive non-malleability from quantum supremacy