scientific article
From MaRDI portal
Publication:3374913
zbMath1082.94504MaRDI QIDQ3374913
Alexandra Boldyreva, Silvio Micali, Mihir Bellare
Publication date: 1 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (75)
Another Look at Tightness ⋮ Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption ⋮ Memory-Tight Reductions for Practical Key Encapsulation Mechanisms ⋮ Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Tightly secure signatures and public-key encryption ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ More efficient DDH pseudorandom generators ⋮ Tightness subtleties for multi-user PKE notions ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption ⋮ Multi-designated receiver signed public key encryption ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Multi-instance secure public-key encryption ⋮ CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts ⋮ A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Salvaging Weak Security Bounds for Blockcipher-Based Constructions ⋮ Puncturable key wrapping and its applications ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Authenticated encryption with key identification ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ Simulation-based bi-selective opening security for public key encryption ⋮ Luby-Rackoff backwards with more users and more security ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors ⋮ Scalable ciphertext compression techniques for post-quantum KEMs and their applications ⋮ On the adaptive security of MACs and PRFs ⋮ Tightly CCA-secure encryption scheme in a multi-user setting with corruptions ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Non-malleable encryption: simpler, shorter, stronger ⋮ State separation for code-based game-playing proofs ⋮ Sharing many secrets with computational provable security ⋮ Efficient certificateless anonymous multi-receiver encryption scheme without bilinear parings ⋮ Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys ⋮ Generalized public-key cryptography with tight security ⋮ Towards Tightly Secure Deterministic Public Key Encryption ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ Signcryption Schemes Based on the Diffie–Hellman Problem ⋮ Public key encryption with filtered equality test revisited ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Compact structure-preserving signatures with almost tight security ⋮ The Multi-user Security of Double Encryption ⋮ Automating Computational Proofs for Public-Key-Based Key Exchange ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Completeness of Single-Bit Projection-KDM Security for Public Key Encryption ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Non-Malleable Encryption: Simpler, Shorter, Stronger ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model ⋮ Strengthening Security of RSA-OAEP ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols ⋮ Everybody's a target: scalability in public-key encryption ⋮ Tightly-secure authenticated key exchange, revisited ⋮ Certified Encryption Revisited ⋮ More efficient digital signatures with tight multi-user security ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ Multi-user BBB security of public permutations based MAC ⋮ Efficient and Provably Secure Certificateless Multi-receiver Signcryption ⋮ Handling adaptive compromise for practical encryption schemes ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Public key signatures in the multi-user setting. ⋮ Quantum generic attacks on key-alternating Feistel ciphers for shorter keys ⋮ Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts ⋮ Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions ⋮ Adaptive Partitioning ⋮ Short identity-based signatures with tight security from lattices
This page was built for publication:
