Confined guessing: new signatures from standard assumptions

DOI10.1007/s00145-014-9183-zzbMath1308.94060OpenAlexW1990147874MaRDI QIDQ2018822

Tibor Jager, Jessica Koch, Christoph Striecks, Florian Böhl, 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

zbMATH Keywords

digital signaturesCDH assumptionSIS assumptionpairing-friendly groupsRSA assumption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Forward-secure revocable secret handshakes from lattices ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Efficient digital signatures from RSA without random oracles ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Access control encryption from group encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Short Signatures from Weaker Assumptions
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Short and Stateless Signatures from the RSA Assumption
• New Generation of Secure and Practical RSA-Based Signatures
• 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
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• Programmable Hash Functions and Their Applications
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Cramer-Shoup Strong-RSA Signature Scheme Revisited
• Practical Signatures from Standard Assumptions
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• An Efficient On-Line/Off-Line Signature Scheme without Random Oracles

This page was built for publication: Confined guessing: new signatures from standard assumptions