scientific article; zbMATH DE number 1302834

From MaRDI portal
Revision as of 16:30, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4249316

zbMath0931.94017MaRDI QIDQ4249316

Daniel Bleichenbacher

Publication date: 8 August 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.





Related Items (52)

On CCA-Secure Somewhat Homomorphic EncryptionOn the Joint Security of Encryption and Signature in EMVPractical cryptanalysis of ISO 9796-2 and EMV signaturesRogue Decryption Failures: Reconciling AE Robustness NotionsTightness subtleties for multi-user PKE notionsPartition oracles from weak key forgeriesA semantically secure public key cryptoscheme using bit-pair shadowsA Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical SecurityNaor-Yung paradigm with shared randomness and applicationsCPA-to-CCA transformation for KDM securityOn the Security of Distributed Multiprime RSAAttacks and Security Proofs of EAX-PrimeOn Symmetric Encryption with Distinguishable Decryption FailuresA Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMsWhen privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculusPreventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme\textit{Caveat implementor!} Key recovery attacks on MEGAKDM security for the Fujisaki-Okamoto transformations in the QROMA public key cryptosystem based on three new provable problemsA one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attackAuthenticated confidential channel establishment and the security of TLS-DHEPractical chosen ciphertext secure encryption from factoringCCA-secure (puncturable) KEMs from encryption with non-negligible decryption errorsClassical misuse attacks on NIST round 2 PQC. The power of rank-based schemesTriggering parametric-down conversion-based quantum key distribution via radiation fieldTag-KEM/DEM: A new framework for hybrid encryptionPost-challenge leakage in public-key encryptionThe TLS handshake protocol: A modular analysisOn Extension of Evaluation Algorithms in Keyed-Homomorphic EncryptionA Modular Security Analysis of the TLS Handshake ProtocolProtecting against key-exposure: strongly key-insulated encryption with optimal thresholdDo Not Bound to a Single Position: Near-Optimal Multi-positional Mismatch Attacks Against Kyber and SaberHow to Forge a Time-Stamp Which Adobe’s Acrobat AcceptsNew Branch Prediction Vulnerabilities in OpenSSL and Necessary Software CountermeasuresCCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric EncryptionCCA security and trapdoor functions via key-dependent-message securityStrengthening Security of RSA-OAEPFully homomorphic encryption beyond IND-CCA1 security: integrity through verifiabilityFully malicious authenticated PIRDecrypting without keys: the case of the GlobalPlatform SCP02 protocolPractical Chosen Ciphertext Secure Encryption from FactoringA Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext AttacksOn the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard ModelCryptographic Verification by Typing for a Sample Protocol ImplementationOn Quantum Chosen-Ciphertext Attacks and Learning with ErrorsOn the CCA compatibility of public-key infrastructureNaor-Yung Paradigm with Shared Randomness and ApplicationsA Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search ProblemsChosen ciphertext attack on ZHFEUniversally Composable Security Analysis of TLSIndifferentiability for public key cryptosystemsA Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol







This page was built for publication: