Tightly Secure Signatures and Public-Key Encryption
From MaRDI portal
Publication:2914286
DOI10.1007/978-3-642-32009-5_35zbMATH Open1296.94152OpenAlexW2404371125MaRDI QIDQ2914286FDOQ2914286
Authors: Dennis Hofheinz, Tibor Jager 
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_35
Recommendations
- Tightly secure signatures and public-key encryption
- Practical and tightly-secure digital signatures and authenticated key exchange
- Confidential Signatures and Deterministic Signcryption
- Signed Diffie-Hellman key exchange with tight security
- Strong Key-Insulated Signature Schemes
- Verifiably encrypted signatures: security revisited and a new construction
- Tightly secure signatures from lossy identification schemes
- Tight security for signature schemes without random oracles
- Authenticated key exchange and signatures with tight security in the standard model
- Tightly secure signature schemes from the LWE and subset sum assumptions
Cited In (75)
- Privacy for Private Key in Signatures
- Threshold structure-preserving signatures
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
- Toothpicks: more efficient fork-free two-round multi-signatures
- Tightly-secure encryption in the multi-user, multi-challenge setting with improved efficiency
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Signed Diffie-Hellman key exchange with tight security
- Iterated random oracle: a universal approach for finding loss in security reduction
- Title not available (Why is that?)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Memory-tight multi-challenge security of public-key encryption
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Miniature CCA2 PK Encryption: Tight Security Without Redundancy
- Short identity-based signatures with tight security from lattices
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Structure-preserving signatures from standard assumptions, revisited
- Practical and tightly-secure digital signatures and authenticated key exchange
- On the security loss of unique signatures
- Structure-preserving signatures and commitments to group elements
- Signatures with Tight Multi-user Security from Search Assumptions
- Basing cryptographic protocols on tamper-evident seals
- Tightly secure signatures and public-key encryption
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Parameter-hiding order revealing encryption
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Proving Tight Security for Rabin-Williams Signatures
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Confidential Signatures and Deterministic Signcryption
- A generic construction of tightly secure signatures in the multi-user setting
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
- Improved, black-box, non-malleable encryption from semantic security
- Hierarchical identity-based encryption with tight multi-challenge security
- Kurosawa-Desmedt meets tight security
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- More efficient digital signatures with tight multi-user security
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Linearly homomorphic structure-preserving signatures and their applications
- Adaptive partitioning
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- Skipping the \(q\) in group signatures
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Tightly secure ring signatures in the standard model
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Towards tightly secure deterministic public key encryption
- Structure preserving CCA secure encryption and applications
- Optimal tightness for chain-based unique signatures
- Tagged one-time signatures: tight security and optimal tag size
- Signatures from sequential-OR proofs
- Verifiable random functions with optimal tightness
- Concise multi-challenge CCA-secure encryption and signatures with almost tight security
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
- Towards tight adaptive security of non-interactive key exchange
- Structure-preserving public-key encryption with leakage-resilient CCA security
- Generalized public-key cryptography with tight security
- On the impossibility of structure-preserving deterministic primitives
- Tightly-Secure Signatures from Chameleon Hash Functions
- Tightly secure hierarchical identity-based encryption
- Tightly CCA-secure encryption without pairings
- Towards tightly secure lattice short signature and id-based encryption
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- Strong Key-Insulated Signature Schemes
- An algebraic framework for Diffie-Hellman assumptions
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- On the tightness of forward-secure signature reductions
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
This page was built for publication: Tightly Secure Signatures and Public-Key Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914286)
