Confined guessing: new signatures from standard assumptions
From MaRDI portal
Publication:2018822
DOI10.1007/S00145-014-9183-ZzbMATH Open1308.94060OpenAlexW1990147874MaRDI QIDQ2018822FDOQ2018822
Authors: Florian Böhl, Tibor Jager, Jessica Koch, Christoph Striecks, Dennis Hofheinz 
Publication date: 25 March 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9183-z
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
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Title not available (Why is that?)
- Efficient Identity-Based Encryption Without Random Oracles
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Title not available (Why is that?)
- Short and Stateless Signatures from the RSA Assumption
- Advances in Cryptology – CRYPTO 2004
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Programmable Hash Functions and Their Applications
- Short signatures from weaker assumptions
- Title not available (Why is that?)
- New generation of secure and practical RSA-based signatures
- Practical signatures from standard assumptions
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
- Practical signatures from standard assumptions
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- 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)
