A Storage Efficient Redactable Signature in the Standard Model

DOI10.1007/978-3-642-04474-8_26MaRDI QIDQ3399214zbMATH OpenOpenAlexFDO

Authors Ryo Nojima, Jin Tamura, Youki Kadobayashi, H. Kikuchi

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

Mathematics Subject Classification ID

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

Recommendations

• A general framework for redactable signatures and new constructions
• A t-out-of-n Redactable Signature Scheme
• Redactable signatures for independent removal of structure and content
• On updatable redactable signatures
• Short Redactable Signatures Using Random Trees

Cites work

• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 2079932 (Why is no real title available?)
• scientific article; zbMATH DE number 1759660 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Information and Communications Security
• Introduction to cryptography. Principles and applications
• New generation of secure and practical RSA-based signatures
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Security analysis of the Gennaro-Halevi-Rabin signature scheme
• Security of Sanitizable Signatures Revisited
• Short Redactable Signatures Using Random Trees
• Short and Stateless Signatures from the RSA Assumption

Cited in

(7)

• Drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs
• Efficient digital signatures from RSA without random oracles
• A t-out-of-n Redactable Signature Scheme
• Ring trapdoor redactable signatures from lattice
• Efficient redactable signature and application to anonymous credentials
• A general framework for redactable signatures and new constructions
• Short Redactable Signatures Using Random Trees

This page was built for publication: A Storage Efficient Redactable Signature in the Standard Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399214)