Confined guessing: new signatures from standard assumptions
From MaRDI portal
Publication:2018822
Recommendations
- Guessing secrets. (Extended abstract)
- Deducibility constraints and blind signatures
- Structure-preserving signatures from standard assumptions, revisited
- Rerandomizable signatures under standard assumption
- Practical signatures from standard assumptions
- The Guessing Secrets problem: a probabilistic approach
- Short signatures from weaker assumptions
- Short Signatures in the Random Oracle Model
- scientific article; zbMATH DE number 1948404
- scientific article; zbMATH DE number 5631814
Cites work
- scientific article; zbMATH DE number 1031000 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology – CRYPTO 2004
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Bonsai trees, or how to delegate a lattice basis
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- New generation of secure and practical RSA-based signatures
- Practical signatures from standard assumptions
- Programmable Hash Functions and Their Applications
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Short and Stateless Signatures from the RSA Assumption
- Short signatures from weaker assumptions
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(16)- A constant-size signature scheme with tighter reduction from CDH assumption
- Efficient digital signatures from RSA without random oracles
- Access control encryption from group encryption
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Practical signatures from standard assumptions
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Forward-secure revocable secret handshakes from lattices
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Adaptive oblivious transfer with access control from lattice assumptions
- Unique signature with short output from CDH assumption
- Two-dimensional representation of cover free families and its applications: short signatures and more
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Forward-Secure Group Encryptions from Lattices
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
This page was built for publication: Confined guessing: new signatures from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018822)
