Anonymity and Application Privacy in Context of Mobile Computing in eHealth

Slamanig, Daniel; Stingl, Christian; Menard, Christian; Heiligenbrunner, Martina; Thierry, Jürgen

doi:10.1007/978-3-642-00440-7_15

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Slamanig et al [19] discussed insider threats in eHealth application that the user has no guarantee that the provider always preserve the users' privacy claims; a person and her requested data are linkable to draw potentially compromising conclusion about her. Bjones et al [4] states that an electronic identity server under control of an insider attacker has the ability to impersonate every user at applications using eIDs for authentication.…”

Section: Related Workmentioning

confidence: 99%

Privacy-preserving and efficient attributes proof based on selective aggregate CL-signature scheme

Guo

Wang

2014

International Journal of Computer Mathematics

View full text Add to dashboard Cite

We propose efficient attributes proof protocols in an anonymous and unlinkable fashion. The core idea is issuing anonymous credentials for each single attribute and proving relations over attributes by selectively aggregating individual anonymous credentials. A selective aggregate Camenisch-Lysyanskaya (CL)-signature scheme is presented to construct anonymous credentials. It is existentially unforgeable against adaptively chosen-message attack under CL-signature scheme on the Lysyanskaya-Rivest-SahaiWolf assumption. It has constant complexity in verification of multiple signatures. Users can select which attributes and the corresponding individual anonymous credentials are involved in the proof. They can prove the possession of attributes over logic relations including AND and OR, and the possession of a single attribute over comparison relations including inequality to a given value and belonging to a given interval. The efficiency analysis shows that the resulting protocols have advantages in computation cost; the AND relation proof and comparison relation proofs have constant complexity w.r.t. the number of attributes, and the OR relation proof has linear complexity only w.r.t. the number of attributes as required.

show abstract

Section: Related Workmentioning

confidence: 99%