scientific article
From MaRDI portal
Publication:2724585
zbMath0984.94509MaRDI QIDQ2724585
David Pointcheval, Tatsuaki Okamoto
Publication date: 5 May 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cryptographysecuritydecision problemsDiffie-Hellman problemsChaum's undeniable signaturegap problemsinverting problems
Related Items (68)
An efficient authenticated key exchange from random self-reducibility on CSIDH ⋮ Towards post-quantum security for signal's X3DH handshake ⋮ Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ An Efficient and Provably Secure Certificate-Based Encryption Scheme ⋮ Blake-Wilson, Johnson \& Menezes protocol revisited ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Strengthening the security of authenticated key exchange against bad randomness ⋮ On security analysis of an after-the-fact leakage resilient key exchange protocol ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Multi-user CDH problems and the concrete security of \(\mathsf{NAXOS}\) and \(\mathsf{X3DH}\) ⋮ Efficient Public-Key Distance Bounding Protocol ⋮ New results and applications for multi-secret sharing schemes ⋮ Sherlock Holmes zero-knowledge protocols ⋮ Generic Constructions of Stateful Public Key Encryption and Their Applications ⋮ Generic constructions of identity-based and certificateless kEMs ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ Efficient NIZKs for algebraic sets ⋮ Identity-based chameleon hashing and signatures without key exposure ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ A formal security analysis of the Signal messaging protocol ⋮ Short undeniable signatures based on group homomorphisms ⋮ New technique for chosen-ciphertext security based on non-interactive zero-knowledge ⋮ Offline witness encryption with semi-adaptive security ⋮ Signcryption Schemes Based on the Diffie–Hellman Problem ⋮ Applications of Signcryption ⋮ Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal ⋮ A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols ⋮ Identification Schemes from Key Encapsulation Mechanisms ⋮ Certificateless one-pass and two-party authenticated key agreement protocol and its extensions ⋮ New Constructions and Applications of Trapdoor DDH Groups ⋮ Identity-based authenticated key agreement protocol based on Weil pairing ⋮ Cryptanalysis of a communication-efficient three-party password authenticated key exchange protocol ⋮ Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks ⋮ Automating Computational Proofs for Public-Key-Based Key Exchange ⋮ Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption ⋮ Simulatable certificateless two-party authenticated key agreement protocol ⋮ Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols ⋮ Identity-based trapdoor mercurial commitments and applications ⋮ Post-Quantum Forward-Secure Onion Routing ⋮ Strongly secure identity-based authenticated key agreement protocols without bilinear pairings ⋮ On the Connection Between Signcryption and One-Pass Key Establishment ⋮ Generic constructions of integrated PKE and PEKS ⋮ A Generic Construction for Universally-Convertible Undeniable Signatures ⋮ The Twin Diffie-Hellman Problem and Applications ⋮ Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keys ⋮ On Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption Schemes ⋮ Separation Results on the “One-More” Computational Problems ⋮ An improved identity-based key agreement protocol and its security proof ⋮ On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments ⋮ Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS ⋮ Everybody's a target: scalability in public-key encryption ⋮ Towards Denial-of-Service-Resilient Key Agreement Protocols ⋮ TMQV: A Strongly eCK-Secure Diffie-Hellman Protocol without Gap Assumption ⋮ Characterization of Strongly Secure Authenticated Key Exchanges without NAXOS Technique ⋮ Identity-Based Deterministic Signature Scheme without Forking-Lemma ⋮ On Forward Secrecy in One-Round Key Exchange ⋮ Comparing SessionStateReveal and EphemeralKeyReveal for Diffie-Hellman Protocols ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ The twin Diffie-Hellman problem and applications ⋮ Leaky Random Oracle (Extended Abstract) ⋮ Certificateless signature and proxy signature schemes from bilinear pairings ⋮ Quantifying the security cost of migrating protocols to practice ⋮ Anonymous tokens with private metadata bit ⋮ A classification of computational assumptions in the algebraic group model ⋮ A Public-Key Encryption Scheme with Pseudo-random Ciphertexts ⋮ IND-CCA secure encryption based on a Zheng-Seberry scheme ⋮ Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols
This page was built for publication:
