scientific article; zbMATH DE number 1759781
From MaRDI portal
Publication:4536804
zbMATH Open0995.94533MaRDI QIDQ4536804FDOQ4536804
Authors: Jean-Sébastien Coron 
Publication date: 28 July 2002
Title of this publication is not available (Why is that?)
Recommendations
- On the Generic Insecurity of the Full Domain Hash
- Optimal security proofs for full domain hash. Revisited
- Optimal security proofs for full domain hash, revisited
- On capabilities of hash domain extenders to preserve enhanced security properties
- scientific article; zbMATH DE number 1942447
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
- On the security of multivariate hash functions
Cited In (63)
- Efficient IBS from a new assumption in the multivariate-quadratic setting
- On proving equivalence class signatures secure from non-interactive assumptions
- Chain Reductions for Multi-signatures and the HBMS Scheme
- Concurrently secure blind Schnorr signatures
- Signatures with memory-tight security in the quantum random oracle model
- A Pairing-free Provable Secure and Efficient Identity-based Identification Scheme with Anonymity
- Identity-based signature and extended forking algorithm in the multivariate quadratic setting
- SoK: how (not) to design and implement post-quantum cryptography
- Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
- The price of verifiability: lower bounds for verifiable random functions
- Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
- Multi-use and unidirectional identity-based proxy re-encryption schemes
- New results and applications for multi-secret sharing schemes
- Threshold RSA for Dynamic and Ad-Hoc Groups
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Optimal security proofs for full domain hash. Revisited
- Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
- Programmable hash functions and their applications
- Strengthening Security of RSA-OAEP
- Optimal security proofs for full domain hash, revisited
- An enhanced \((t,n)\) threshold directed signature scheme
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Short variable length domain extenders with beyond birthday bound security
- On the security of RSA textbook signature scheme on Paillier ciphertext
- Virtual smart cards: how to sign with a password and a server
- An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- On tight security proofs for Schnorr signatures
- Title not available (Why is that?)
- Short undeniable signatures based on group homomorphisms
- The wonderful world of global random oracles
- Programmable Hash Functions and Their Applications
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Identity-Based Batch Provable Data Possession
- Cliptography: clipping the power of kleptographic attacks
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Private set-intersection with common set-up
- Key regeneration-free ciphertext-policy attribute-based encryption and its application
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Efficient Sequential Aggregate Signed Data
- On the Generic Insecurity of the Full Domain Hash
- Identity-based chameleon hashing and signatures without key exposure
- Another look at tightness
- Towards tight adaptive security of non-interactive key exchange
- Attribute-based signatures from RSA
- Homomorphic Encryption and Signatures from Vector Decomposition
- Non-adaptive programmability of random oracle
- Improving signature schemes with tight security reductions
- Public Key Encryption with Searchable Keywords Based on Jacobi Symbols
- On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- Generalized public-key cryptography with tight security
- Identity-based ring signatures from RSA
- Generic groups, collision resistance, and ECDSA
- The cost of adaptivity in security games on graphs
- MQ Aggregate Signature Schemes with Exact Security Based on UOV Signature
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
- On instantiating the algebraic group model from falsifiable assumptions
- Confined guessing: new signatures from standard assumptions
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 Q4536804)
