scientific article; zbMATH DE number 4035726

Cited in

(25)

Synthesizers and their application to the parallel construction of pseudo-random functions
Improving the exact security of digital signature schemes
On the tightness of forward-secure signature reductions
On-line/off-line digital signatures
Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
Tightly secure signature schemes from the LWE and subset sum assumptions
Short signatures from Diffie-Hellman: realizing almost compact public key
A generic construction of tightly secure signatures in the multi-user setting
Key regeneration-free ciphertext-policy attribute-based encryption and its application
Linicrypt: a model for practical cryptography
Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
From Identification to Signatures, Tightly: A Framework and Generic Transforms
Tightly secure signatures and public-key encryption
One-time signatures and chameleon hash functions
Realizing Hash-and-Sign Signatures under Standard Assumptions
Pseudorandom functions: three decades later
Universal samplers with fast verification
Tighter security proofs for GPV-IBE in the quantum random oracle model
Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
Verifiable Obtained Random Subsets for Improving SPHINCS+
At the top of the hypercube -- better size-time tradeoffs for hash-based signatures
HBSS: (simple) hash-based stateless signatures -- hash all the way to the rescue!
SoK: how (not) to design and implement post-quantum cryptography

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775469)