Generalizations and Extensions of Redactable Signatures with Applications to Electronic Healthcare

Slamanig, Daniel; Raß, Stefan

doi:10.1007/978-3-642-13241-4_19

Cited by 20 publications

(10 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Basically, they can be constructed from any secure DSS relying on the hash-then-sign paradigm by virtue of modifying the construction of the hash value (typically using randomized Merkle-Hash trees instead of a plain cryptographic hash of the entire message). Besides RS constructions for linear documents, there are also approaches for treestructured documents, e.g., XML documents (Brzuska et al, 2010;Slamanig and Rass, 2010). Below, we present an abstract definition of redactable signature schemes.…”

Section: Redactable Signaturesmentioning

confidence: 99%

Design strategies for a privacy-friendly Austrian eID system in the public cloud

Zwattendorfer

Slamanig

2015

Computers & Security

Self Cite

View full text Add to dashboard Cite

Section: Redactable Signaturesmentioning

confidence: 99%

Design strategies for a privacy-friendly Austrian eID system in the public cloud

Zwattendorfer

Slamanig

2015

Computers & Security

Self Cite

View full text Add to dashboard Cite

“…Indeed, when receiving a ciphertext or a signature the recipient should not be able to say if the received cryptographic form has been updated or not! Redactable signatures [26] form another kind of scheme allowing the update of cryptographic forms. In contrast with incremental cryptography, redactable signature schemes allow the redaction of the signature without the intervention of the signer.…”

Section: ) Use Case: Incremental Cryptography and Redactable Signaturesmentioning

confidence: 99%

Managing the Privacy and Security of eHealth Data

Soceanu

Vаsylenko

Egner

et al. 2015

2015 20th International Conference on Control Systems and Computer Science

View full text Add to dashboard Cite

The large scale adoption of mobile medicine, supported by an increasing number of medical devices and remote access to health services, correlated with the continuous involvement of the patients in their own healthcare, led to the emergence of tremendous amounts of clinical data. They need to be securely transferred, archived and accessed. This paper refers to a new approach for protecting the privacy and security of clinical data through the use of a state of the art encryption scheme and attribute-based access control authorization framework. As personal medical records are often used by different entities (e.g. doctors, pharmacists, nurses, etc.), there is a need for different degrees of authorization access for specific parts of the personal dossier. Appropriate cryptographic tools are presented for allowing partial visibility and valid protection on authorized parts for hierarchical privacy protection of eHealth data. The encryption process relies on ARCANA, a security platform developed at ERISCS research laboratory from University Aix-Marseille. It provides the appropriate cryptographic tools for secure hierarchical access to healthcare data. This ensures that the access of various entities to the healthcare data is accurately and hierarchically controlled. The access control framework used in this research is based on XACML, a standard access control decision model specified by OASIS. The applicability and feasibility of XACML-based policies to regulate the access to patient data are demonstrated through SAFAX. SAFAX is a new public authorization framework developed by the Eindhoven University of Technology tested among others on eHealth case studies, in cooperation with Munich University of Applied Sciences. It is envisioned that the usage of data encryption and public authorization solutions to regulate access control on patients clinical data will have a big impact on the patient's trust in electronic healthcare systems and will speed up their large scale adoption.

show abstract

“…Dieser Ansatz wurde in [7] für beliebige k-äre Hashbäume (bei denen auch inneren Knoten Nachrichtenblöcke zugeordnet werden können) verallgemeinert, so dass bei baumförmig strukturierten Dokumenten (wie etwa XML Dokumenten) die inhärente Baumstruktur zur Abgrenzung der einzelnen Nachrichtenblöcke direkt genutzt werden kann. Man bedenke, dass bei allen zuvor diskutierten Ansätzen davon ausgegangen wird, dass Dokumente linear, also als geordnete Abfolge von Blöcken, organisiert sind.…”

Section: Hashbäumeunclassified