Tightly Secure Signatures and Public-Key Encryption
From MaRDI portal
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
(80)- Signed Diffie-Hellman key exchange with tight security
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- 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
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Iterated random oracle: a universal approach for finding loss in security reduction
- Privacy for Private Key in Signatures
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- scientific article; zbMATH DE number 2086700 (Why is no real title available?)
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Threshold structure-preserving signatures
- Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Miniature CCA2 PK Encryption: Tight Security Without Redundancy
- Memory-tight multi-challenge security of public-key encryption
- 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
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Structure-preserving signatures and commitments to group elements
- Tightly secure signatures and public-key encryption
- Parameter-hiding order revealing encryption
- Basing cryptographic protocols on tamper-evident seals
- Signatures with Tight Multi-user Security from Search Assumptions
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
- Proving Tight Security for Rabin-Williams Signatures
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- A generic construction of tightly secure signatures in the multi-user setting
- Confidential Signatures and Deterministic Signcryption
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Improved, black-box, non-malleable encryption from semantic security
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
- Kurosawa-Desmedt meets tight security
- Hierarchical identity-based encryption with tight multi-challenge 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
- Tightly, adaptively secure proxy re-encryption in multi-challenge setting
- Tightly-secure blind signatures in pairing-free groups
- More efficient digital signatures with tight multi-user security
- Linearly homomorphic structure-preserving signatures and their applications
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality
- Skipping the \(q\) in group signatures
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Adaptive partitioning
- Tightly secure ring signatures in the standard model
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- 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
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Optimal tightness for chain-based unique signatures
- Structure preserving CCA secure encryption and applications
- Signatures from sequential-OR proofs
- Tagged one-time signatures: tight security and optimal tag size
- Tightly secure inner-product functional encryption revisited: compact, lattice-based, and more
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
- Toothpicks: more efficient fork-free two-round multi-signatures
- 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
- On the impossibility of structure-preserving deterministic primitives
- Generalized public-key cryptography with tight security
- Tightly-Secure Signatures from Chameleon Hash Functions
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- An algebraic framework for Diffie-Hellman assumptions
- Tightly CCA-secure encryption without pairings
- Towards tightly secure lattice short signature and id-based encryption
- Tightly secure hierarchical identity-based encryption
- Strong Key-Insulated Signature Schemes
- On the tightness of forward-secure signature reductions
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)
