Towards tight adaptive security of non-interactive key exchange
From MaRDI portal
Publication:2697896
DOI10.1007/978-3-030-90456-2_10OpenAlexW3213872552MaRDI QIDQ2697896
Lisa Kohl, Julia Hesse, Roman Langrehr, Dennis Hofheinz
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_10
Related Items (max. 100)
Optimal tightness for chain-based unique signatures ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Adaptive multiparty NIKE
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signal-flow-based analysis of wireless security protocols
- On tightly secure non-interactive key exchange
- Practical chosen ciphertext secure encryption from factoring
- Provably secure non-interactive key distribution based on pairings
- Tightly CCA-Secure Encryption Without Pairings
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- An Algebraic Framework for Diffie-Hellman Assumptions
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Tightly Secure Signatures and Public-Key Encryption
- Forward Secure Non-Interactive Key Exchange
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Pseudo-random functions and factoring (extended abstract)
- Bounded CCA2-Secure Encryption
- Lossy trapdoor functions and their applications
- Composability and On-Line Deniability of Authentication
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Building Key-Private Public-Key Encryption Schemes
- New directions in cryptography
- Breaking RSA may not be equivalent to factoring
- Nonmalleable Cryptography
- Applied Cryptography and Network Security
- Non-Interactive Key Exchange
- Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange
- How to use indistinguishability obfuscation
- Tightly-Secure Authenticated Key Exchange
- Why Proving HIBE Systems Secure Is Difficult
- The Twin Diffie-Hellman Problem and Applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- On the Impossibility of Tight Cryptographic Reductions
- Theory of Cryptography
- Tightly secure hierarchical identity-based encryption
This page was built for publication: Towards tight adaptive security of non-interactive key exchange
