scientific article
From MaRDI portal
Publication:4035737
zbMath0767.94006MaRDI QIDQ4035737
Daniel Simon, Charles W. Rackoff
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Practical algorithm substitution attack on extractable signatures ⋮ Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption ⋮ Toward RSA-OAEP Without Random Oracles ⋮ A practical approach to attaining chosen ciphertext security ⋮ Signature schemes secure against hard-to-invert leakage ⋮ Tightly secure signatures and public-key encryption ⋮ An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption ⋮ Group-Based Source-Destination Verifiable Encryption with Blacklist Checking ⋮ Compact Lossy and All-but-One Trapdoor Functions from Lattice ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions ⋮ How to construct secure proxy cryptosystem ⋮ Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment ⋮ Sponge Based CCA2 Secure Asymmetric Encryption for Arbitrary Length Message ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ COA-secure obfuscation and applications ⋮ Multi-designated receiver signed public key encryption ⋮ Anonymity of NIST PQC round 3 KEMs ⋮ On characterizations of escrow encryption schemes ⋮ Traceable PRFs: Full Collusion Resistance and Active Security ⋮ CPA-to-CCA transformation for KDM security ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Practical proofs of knowledge without relying on theoretical proofs of membership on languages ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity ⋮ Formal Security Treatments for Signatures from Identity-Based Encryption ⋮ A Brief History of Provably-Secure Public-Key Encryption ⋮ Traceable Privacy of Recent Provably-Secure RFID Protocols ⋮ A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle ⋮ Parallel repetition of computationally sound protocols revisited ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ Universally composable symbolic security analysis ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Secure integration of asymmetric and symmetric encryption schemes ⋮ Discrete logarithm based additively homomorphic encryption and secure data aggregation ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ Tightly CCA-secure encryption scheme in a multi-user setting with corruptions ⋮ A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Security models and proof strategies for plaintext-aware encryption ⋮ Achieving IND-CCA Security for Functional Encryption for Inner Products ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ A note on a provable secure encryption scheme ⋮ Anonymous Proxy Signatures ⋮ Simplified Submission of Inputs to Protocols ⋮ Optimistic fair exchange in the enhanced chosen-key model ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Two-factor mutual authentication based on smart cards and passwords ⋮ Robust encryption ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited ⋮ Tag-KEM/DEM: A new framework for hybrid encryption ⋮ On the security of public key cryptosystems with a double decryption mechanism ⋮ Obfuscation for cryptographic purposes ⋮ A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack ⋮ Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption ⋮ Efficient hybrid encryption from ID-based encryption ⋮ Some (in)sufficient conditions for secure hybrid encryption ⋮ Signcryption from randomness recoverable public key encryption ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption ⋮ OAEP Is Secure under Key-Dependent Messages ⋮ Protecting against key-exposure: strongly key-insulated encryption with optimal threshold ⋮ The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure ⋮ Improved efficiency of Kiltz07-KEM ⋮ Non-malleability Under Selective Opening Attacks: Implication and Separation ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption ⋮ Secure ElGamal-Type Cryptosystems Without Message Encoding ⋮ An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ Efficient public key encryption with smallest ciphertext expansion from factoring ⋮ Key-dependent message security: generic amplification and completeness ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model ⋮ A New Randomness Extraction Paradigm for Hybrid Encryption ⋮ Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures ⋮ Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme ⋮ Authenticated encryption: relations among notions and analysis of the generic composition paradigm ⋮ On the Theoretical Gap between Group Signatures with and without Unlinkability ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ On the CCA compatibility of public-key infrastructure ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions ⋮ Direct chosen-ciphertext secure identity-based key encapsulation without random oracles ⋮ Provably secure Rabin-p cryptosystem in hybrid setting ⋮ A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems ⋮ Robust Encryption ⋮ Insight of the protection for data security under selective opening attacks ⋮ A new cryptosystem based on a twisted Hessian curve \(H^4_{a,d}\) ⋮ Security analysis and improvement of a double-trapdoor encryption scheme ⋮ A public key cryptosystem based on a subgroup membership problem ⋮ Chosen ciphertext security from injective trapdoor functions ⋮ A performance evaluation of pairing-based broadcast encryption systems ⋮ On the Impossibility of Strong Encryption Over $\aleph_0$ ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ Implicit rejection in Fujisaki-Okamoto: framework and a novel realization ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ IND-CCA security of Kyber in the quantum random oracle model, revisited ⋮ Concurrently composable non-interactive secure computation ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates ⋮ On Privacy Models for RFID ⋮ Group Encryption ⋮ Delegation of cryptographic servers for capture-resilient devices ⋮ Chasing Diagrams in Cryptography ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance ⋮ Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption ⋮ Towards Key-Dependent Message Security in the Standard Model ⋮ CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Escrow-free encryption supporting cryptographic workflow ⋮ Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures ⋮ A CCA Secure Hybrid Damgård’s ElGamal Encryption ⋮ A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
