On structure-preserving cryptography and lattices
From MaRDI portal
(Redirected from Publication:6635826)
Recommendations
- Efficient Structure-Preserving Signature Scheme from Standard Assumptions
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Improved (almost) tightly-secure structure-preserving signatures
- Floppy-sized group signatures from lattices
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A new hash-and-sign approach and structure-preserving signatures from DLIN
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - CRYPTO 2003
- Bonsai trees, or how to delegate a lattice basis
- Commuting signatures and verifiable encryption
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient lattice (H)IBE in the standard model
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Fiat-Shamir: from practice to theory
- Group encryption: non-interactive realization in the standard model
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1302845 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lattice signatures without trapdoors
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Optimal structure-preserving signatures. (Abstract)
- Optimistic fair exchange of digital signatures
- P-signatures and Noninteractive Anonymous Credentials
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Practical product proofs for lattice commitments
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- Structure preserving CCA secure encryption and applications
- Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
- Structure-preserving certificateless encryption and its application
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Structure-preserving signatures and commitments to group elements
- Structure-preserving smooth projective hashing
- Trapdoors for hard lattices and new cryptographic constructions
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)
