Adaptive partitioning
From MaRDI portal
Recommendations
- Tightly Secure Signatures and Public-Key Encryption
- Tightly secure signatures and public-key encryption
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Concise multi-challenge CCA-secure encryption and signatures with almost tight security
- Kurosawa-Desmedt meets tight security
Cites work
- (Hierarchical) identity-based encryption from affine message authentication
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Framework for Identity-Based Encryption with Almost Tight Security
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- An algebraic framework for Diffie-Hellman assumptions
- Compactly hiding linear spans. Tightly secure constant-size simulation-sound QA-NIZK proofs and applications
- Concise multi-challenge CCA-secure encryption and signatures with almost tight security
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Extended Nested Dual System Groups, Revisited
- Extended-DDH and lossy trapdoor functions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- Number-theoretic constructions of efficient pseudo-random functions
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Quasi-adaptive NIZK for linear subspaces revisited
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Stronger security proofs for RSA and Rabin bits.
- Tagged one-time signatures: tight security and optimal tag size
- The Group of Signed Quadratic Residues and Applications
- Tightly CCA-secure encryption without pairings
- Tightly Secure Signatures and Public-Key Encryption
Cited in
(28)- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Kurosawa-Desmedt meets tight security
- An adaptive algorithm for vector partitioning
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- Tightly secure ring signatures in the standard model
- Short tightly secure signatures for signing a vector of group elements: a new approach
- A generic construction of tightly secure signatures in the multi-user setting
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Concise multi-challenge CCA-secure encryption and signatures with almost tight security
- Tightly secure signatures and public-key encryption
- Finding tailored partitions
- Hierarchical identity-based encryption with tight multi-challenge security
- New Proof for BKP IBE Scheme and Improvement in the MIMC Setting
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Tightly Secure IBE Under Constant-Size Master Public Key
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Unbounded inner product functional encryption from bilinear maps
- Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
- Asymmetric group message franking: definitions and constructions
- Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- Compact structure-preserving signatures with almost tight security
- Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting
- 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, adaptively secure proxy re-encryption in multi-challenge setting
- Tightly-secure blind signatures in pairing-free groups
This page was built for publication: Adaptive partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270372)
