scientific article; zbMATH DE number 2086712
From MaRDI portal
Publication:4737250
zbMath1055.94025MaRDI QIDQ4737250
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2332/23320272.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (42)
Generic construction for tightly-secure signatures from discrete log ⋮ Another Look at Tightness ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ On the security loss of unique signatures ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Towards Non-Black-Box Separations of Public Key Encryption and One Way Function ⋮ On the security of the Courtois-Finiasz-Sendrier signature ⋮ Memory lower bounds of reductions revisited ⋮ Optimal tightness for chain-based unique signatures ⋮ Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Identity-based encryption in DDH hard groups ⋮ On tight security proofs for Schnorr signatures ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ The power of undirected rewindings for adaptive security ⋮ On optimal tightness for key exchange with full forward secrecy via key confirmation ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ On the adaptive security of MACs and PRFs ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ On the tightness of forward-secure signature reductions ⋮ Sequential aggregate signatures with lazy verification from trapdoor permutations ⋮ Generalized public-key cryptography with tight security ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Security of Digital Signature Schemes in Weakened Random Oracle Models ⋮ On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Verifiable random functions with optimal tightness ⋮ On selective-opening security of deterministic primitives ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Identity-based signatures in standard model ⋮ Leaky Random Oracle (Extended Abstract) ⋮ How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions ⋮ Better concrete security for half-gates garbling (in the multi-instance setting)
This page was built for publication:
