scientific article; zbMATH DE number 2086712

From MaRDI portal
Publication:4737250

zbMath1055.94025MaRDI QIDQ4737250

Jean-Sébastien Coron

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 logAnother Look at TightnessOn Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation SoundnessIndifferentiability security of the fast wide pipe hash: breaking the birthday barrierOn the security loss of unique signaturesQuantum algorithms for the \(k\)-XOR problemTowards Non-Black-Box Separations of Public Key Encryption and One Way FunctionOn the security of the Courtois-Finiasz-Sendrier signatureMemory lower bounds of reductions revisitedOptimal tightness for chain-based unique signaturesHiding in plain sight: memory-tight proofs via randomness programmingDigital Signatures with Memory-Tight Security in the Multi-challenge SettingIdentity-based encryption in DDH hard groupsOn tight security proofs for Schnorr signaturesLattice-based signatures with tight adaptive corruptions and moreOn pairing-free blind signature schemes in the algebraic group modelThe power of undirected rewindings for adaptive securityOn optimal tightness for key exchange with full forward secrecy via key confirmationOn the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle modelKey encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightnessThe price of verifiability: lower bounds for verifiable random functionsOn the adaptive security of MACs and PRFsTowards tight adaptive security of non-interactive key exchangeSimple and more efficient PRFs with tight security from LWE and matrix-DDHOn the tightness of forward-secure signature reductionsSequential aggregate signatures with lazy verification from trapdoor permutationsGeneralized public-key cryptography with tight securityOptimal security proofs for full domain hash. RevisitedSubversion-resilient signatures: definitions, constructions and applicationsSecurity of Digital Signature Schemes in Weakened Random Oracle ModelsOn the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deploymentsSalvaging Merkle-Damgård for Practical ApplicationsTight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signaturesSecurity of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher ModelImpossibility on tamper-resilient cryptography with uniqueness propertiesVerifiable random functions with optimal tightnessOn selective-opening security of deterministic primitivesPractical Round-Optimal Blind Signatures in the Standard Model from Weaker AssumptionsIdentity-based signatures in standard modelLeaky Random Oracle (Extended Abstract)How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash FunctionsBetter concrete security for half-gates garbling (in the multi-instance setting)




This page was built for publication: