scientific article; zbMATH DE number 1842495
From MaRDI portal
zbMath1002.94519MaRDI QIDQ4783729
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390239
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Toward RSA-OAEP Without Random Oracles, Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier, Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms, Bug attacks, Multi-use and unidirectional identity-based proxy re-encryption schemes, An efficient post-quantum KEM from CSIDH, A semantically secure public key cryptoscheme using bit-pair shadows, A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security, Post-quantum Security of Plain OAEP Transform, CryptHOL: game-based proofs in higher-order logic, Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials, Prio+: privacy preserving aggregate statistics via Boolean shares, A public key cryptosystem based on three new provable problems, On quantum ciphertext indistinguishability, recoverability, and OAEP, Secure integration of asymmetric and symmetric encryption schemes, Possibility and impossibility results for selective decommitments, Semi-automated verification of security proofs of quantum cryptographic protocols, Chasing Diagrams in Cryptography, Tag-KEM/DEM: A new framework for hybrid encryption, Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices, Code-Based Public-Key Cryptosystems and Their Applications, Signcryption from randomness recoverable public key encryption, Using LLL-Reduction for Solving RSA and Factorization Problems, The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance, Bug Attacks, Chosen Ciphertext Security with Optimal Ciphertext Overhead, Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding, Beyond Provable Security Verifiable IND-CCA Security of OAEP, Expedient Non-malleability Notions for Hash Functions, Strengthening Security of RSA-OAEP, Semantic security for the McEliece cryptosystem without random oracles, Efficient public key encryption with smallest ciphertext expansion from factoring, Efficient Identity-Based Signcryption in the Standard Model, Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model, Escrow-free encryption supporting cryptographic workflow, Efficiency Limitations for Σ-Protocols for Group Homomorphisms
