Dynamic puncturable encryption

DOI10.1007/978-3-032-32560-0_4MaRDI QIDQ7411893zbMATH OpenFDO

Authors Priyanka Dutta, Willy Susilo, Fuchun Guo, Dung Hoang Duong

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-32560-0_4

zbMATH Keywords

access controllearning with errorsrevoke or restore decryption capabilityupdatable ciphertext

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• 0-RTT key exchange with full forward secrecy
• Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
• Bonsai trees, or how to delegate a lattice basis
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Classical hardness of learning with errors
• Efficient lattice (H)IBE in the standard model
• Fine-grained forward secrecy: allow-list/deny-list encryption and applications
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Generating hard instances of the short basis problem
• Generating shorter bases for hard random lattices
• scientific article; zbMATH DE number 1842485 (Why is no real title available?)
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Public-key cryptosystems from the worst-case shortest vector problem
• Puncturable identity-based and attribute-based encryption from lattices
• Puncturable Identity-Based Encryption from Lattices
• Revisiting proxy re-encryption: forward secrecy, improved security, and applications
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

This page was built for publication: Dynamic puncturable encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411893)