scientific article; zbMATH DE number 5009203
From MaRDI portal
Publication:3374913
zbMATH Open1082.94504MaRDI QIDQ3374913FDOQ3374913
Authors: M. Bellare, Alexandra Boldyreva, Silvio Micali 
Publication date: 1 March 2006
Title of this publication is not available (Why is that?)
Recommendations
- Hybrid encryption in a multi-user setting, revisited
- Public-key cryptography in the fine-grained setting
- Multi-instance secure public-key encryption
- Multi-recipient Public-Key Encryption from Simulators in Security Proofs
- Tightly-secure encryption in the multi-user, multi-challenge setting with improved efficiency
- On the security of multikey homomorphic encryption
- The Multi-user Security of Double Encryption
- Multipurpose public-key encryption
- Multivariate public key cryptosystems
- Multivariate public key cryptosystems
Cited In (87)
- Luby-Rackoff backwards with more users and more security
- Multi-instance secure public-key encryption
- Certified Encryption Revisited
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Title not available (Why is that?)
- Bringing order to chaos: the case of collision-resistant chameleon-hashes
- Multi-user security of the Elephant v2 authenticated encryption mode
- A sponge-based PRF with good multi-user security
- A modular approach to the security analysis of two-permutation constructions
- Simulation-based bi-selective opening security for public key encryption
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- Title not available (Why is that?)
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
- SoK: public key encryption with openings
- The multi-user security of MACs via universal hashing in the ideal cipher model
- Toothpicks: more efficient fork-free two-round multi-signatures
- Key exchange with tight (full) forward secrecy via key confirmation
- Information-theoretic security with asymmetries
- Practical traceable receipt-free encryption
- Automating Computational Proofs for Public-Key-Based Key Exchange
- Puncturable key wrapping and its applications
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Non-malleable encryption: simpler, shorter, stronger
- Ad-hoc threshold broadcast encryption with shorter ciphertexts
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys
- The Multi-user Security of Double Encryption
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Memory-tight multi-challenge security of public-key encryption
- Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
- Short identity-based signatures with tight security from lattices
- Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Strengthening Security of RSA-OAEP
- Non-malleable encryption: simpler, shorter, stronger
- Tightly secure signatures and public-key encryption
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Short variable length domain extenders with beyond birthday bound security
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- State separation for code-based game-playing proofs
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
- Connecting tweakable and multi-key blockcipher security
- CryptHOL: game-based proofs in higher-order logic
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Tightness subtleties for multi-user PKE notions
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- More efficient digital signatures with tight multi-user security
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- Authenticated encryption with key identification
- Adaptive partitioning
- Lattice-based signatures with tight adaptive corruptions and more
- Public key signatures in the multi-user setting.
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Completeness of single-bit projection-KDM security for public key encryption
- Towards tightly secure deterministic public key encryption
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Scalable ciphertext compression techniques for post-quantum KEMs and their applications
- Multi-designated receiver signed public key encryption
- Everybody's a target: scalability in public-key encryption
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Signcryption schemes based on the Diffie-Hellman problem
- Compact structure-preserving signatures with almost tight security
- Tightly-secure authenticated key exchange, revisited
- Computational soundness of symbolic analysis for protocols using hash functions
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
- Another look at tightness
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
- Sharing many secrets with computational provable security
- Efficient and Provably Secure Certificateless Multi-receiver Signcryption
- More efficient DDH pseudorandom generators
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
- A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting
- On the adaptive security of MACs and PRFs
- Generalized public-key cryptography with tight security
- Efficient certificateless anonymous multi-receiver encryption scheme without bilinear parings
- Public key encryption with filtered equality test revisited
- CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts
- Salvaging weak security bounds for blockcipher-based constructions
- Multi-user BBB security of public permutations based MAC
- Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Handling adaptive compromise for practical encryption schemes
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
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 Q3374913)
