Tightly secure signatures and public-key encryption
From MaRDI portal
Publication:300383
DOI10.1007/s10623-015-0062-xzbMath1348.94057OpenAlexW2022454396WikidataQ120912515 ScholiaQ120912515MaRDI QIDQ300383
Publication date: 27 June 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0062-x
Related Items (8)
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Tightness subtleties for multi-user PKE notions ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Fine-grained verifier NIZK and its applications ⋮ Compact structure-preserving signatures with almost tight security ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Still wrong use of pairings in cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Public key signatures in the multi-user setting.
- On-line/off-line digital signatures
- All-But-Many Lossy Trapdoor Functions
- Tightly Secure Signatures and Public-Key Encryption
- Practical Adaptive Oblivious Transfer from Simple Assumptions
- Tight Proofs for Signature Schemes without Random Oracles
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Structure-Preserving Signatures and Commitments to Group Elements
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Group Encryption: Non-interactive Realization in the Standard Model
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Nonmalleable Cryptography
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Secure integration of asymmetric and symmetric encryption schemes
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- Proving Tight Security for Rabin-Williams Signatures
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
This page was built for publication: Tightly secure signatures and public-key encryption