A Storage Efficient Redactable Signature in the Standard Model
From MaRDI portal
Publication:3399214
DOI10.1007/978-3-642-04474-8_26zbMath1307.94120OpenAlexW1488523815MaRDI QIDQ3399214
Hiroaki Kikuchi, Youki Kadobayashi, Jin Tamura, Ryo Nojima
Publication date: 29 September 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04474-8_26
Related Items (4)
Ring Trapdoor Redactable Signatures from Lattice ⋮ Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs ⋮ Efficient digital signatures from RSA without random oracles ⋮ Efficient redactable signature and application to anonymous credentials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short and Stateless Signatures from the RSA Assumption
- New Generation of Secure and Practical RSA-Based Signatures
- Security of Sanitizable Signatures Revisited
- Short Redactable Signatures Using Random Trees
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Information and Communications Security
- Introduction to cryptography. Principles and applications
This page was built for publication: A Storage Efficient Redactable Signature in the Standard Model