Pith. sign in

REVIEW 3 cited by

A Note on Quantum-Secure PRPs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.05564 v3 pith:PXVTZECF submitted 2016-11-17 cs.CR cs.CCquant-ph

classification cs.CRcs.CCquant-ph
keywords quantum-secureprpsconstructpseudorandomadversaryapplicationsclassicalcombines
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We show how to construct pseudorandom permutations (PRPs) that remain secure even if the adversary can query the permutation, both in the forward and reverse directions, on a quantum superposition of inputs. Such quantum-secure PRPs have found numerous applications in cryptography and complexity theory. Our construction combines a quantum-secure pseudorandom function together with constructions of classical format preserving encryption. By combining known results, we show how to construct quantum-secure PRP in this model whose security relies only on the existence of one-way functions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations

    cs.CR 2025-07 conditional novelty 9.0 of 10

    The first standard-model one-shot signatures and the first standard-model separation between classical and collapse-binding commitments, built from permutable PRPs and sub-exponential iO.

  2. Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms

    quant-ph 2025-09 accept novelty 7.0 of 10

    Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).

  3. MicroCrypt Assumptions with Quantum Input Sampling and Pseudodeterminism: Constructions and Separations

    quant-ph 2025-05 conditional novelty 7.0 of 10

    Quantum input sampling turns several MicroCrypt primitives into equivalent weak forms, and black-box separations show these forms are strictly weaker than uniform-sampling primitives.

Pith tools