On structure-preserving cryptography and lattices
From MaRDI portal
Publication:6635826
DOI10.1007/978-3-031-57725-3_9MaRDI QIDQ6635826
Bogdan Ursu, Dennis Hofheinz, Kristina Hostáková, Roman Langrehr
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Structure-preserving certificateless encryption and its application
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Lattice Signatures without Trapdoors
- A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
- Structure-Preserving Smooth Projective Hashing
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Commuting Signatures and Verifiable Encryption
- Optimal Structure-Preserving Signatures
- Structure Preserving CCA Secure Encryption and Applications
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Structure-Preserving Signatures and Commitments to Group Elements
- A Framework for Efficient and Composable Oblivious Transfer
- Group Encryption: Non-interactive Realization in the Standard Model
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Optimistic fair exchange of digital signatures
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Fiat-Shamir: from practice to theory
- Advances in Cryptology - CRYPTO 2003
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On structure-preserving cryptography and lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635826)
