Bonsai trees, or how to delegate a lattice basis (Q1928766): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983370494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Lattice (H)IBE in the Standard Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Shorter Bases for Hard Random Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Encryption from the Weil Pairing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chosen‐Ciphertext Security from Identity‐Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forward-secure public-key encryption scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bonsai Trees, or How to Delegate a Lattice Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Identity Based Encryption Scheme Based on Quadratic Residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Encryption with Searchable Keywords Based on Jacobi Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Broadcast Encryption for Stateless Receivers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Identity-Based Encryption Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Identity Based Encryption with Polynomially Many Levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical ID-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short and Stateless Signatures from the RSA Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Risky Is the Random-Oracle Model? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Efficient Lattice-Based Digital Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing the hermite normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient and Parallel Gaussian Sampler for Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based Cryptosystems and Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Public Key Encryption Based on Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Identity-Based Encryption Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions / rank
 
Normal rank

Latest revision as of 02:10, 6 July 2024

scientific article
Language Label Description Also known as
English
Bonsai trees, or how to delegate a lattice basis
scientific article

    Statements

    Bonsai trees, or how to delegate a lattice basis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 January 2013
    0 references
    hierarchical identity-based encryption
    0 references
    digital signatures
    0 references
    bonsai trees
    0 references
    lattice-based cryptographic structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers