Forward-secure revocable secret handshakes from lattices
From MaRDI portal
Publication:6166997
Recommendations
- Lattice-based secret handshakes with reusable credentials
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Forward security of Fiat-Shamir lattice signatures
- Lattice blind signatures with forward security
- Revocable Identity-Based Encryption from Lattices
- Proxy re-encryption and re-signatures from lattices
- Forward-secure group signatures from lattices
Cites work
- scientific article; zbMATH DE number 1583774 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 1842500 (Why is no real title available?)
- scientific article; zbMATH DE number 1418310 (Why is no real title available?)
- scientific article; zbMATH DE number 1440063 (Why is no real title available?)
- Bonsai trees, or how to delegate a lattice basis
- Confined guessing: new signatures from standard assumptions
- DSH: Deniable Secret Handshake Framework
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Forward-Secure Group Signatures from Pairings
- Forward-secure group signatures from lattices
- Fully forward-secure group signatures
- Generating shorter bases for hard random lattices
- Group Secret Handshakes Or Affiliation-Hiding Authenticated Group Key Agreement
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice cryptography for the internet
- Lattice-based secret handshakes with reusable credentials
- Minimum disclosure proofs of knowledge
- On lattices, learning with errors, random linear codes, and cryptography
- Private Mutual Authentication and Conditional Oblivious Transfer
- Public-key cryptosystems from the worst-case shortest vector problem
- Secret Handshakes from CA-Oblivious Encryption
- Secret handshakes with dynamic expressive matching policy
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Cited in
(3)
This page was built for publication: Forward-secure revocable secret handshakes from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166997)