Share This Author
RERUM: Building a reliable IoT upon privacy- and security- enabled smart objects
- H. C. Pöhls, V. Angelakis, Theodoros Mouroutis
- Computer ScienceIEEE Wireless Communications and Networking…
- 6 April 2014
The RERUM framework will comprise an architecture, built upon novel network protocols and interfaces as well as the design of smart objects hardware that will allow IoT applications to consider security and privacy mechanisms early in their design phase, ensuring a configurable balance between reliability and privacy.
Designing, Developing, and Facilitating Smart Cities
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria.…
On Structural Signatures for Tree Data Structures
- Kai Samelin, H. C. Pöhls, A. Bilzhause, J. Posegga, H. Meer
- Computer Science, MathematicsACNS
- 26 June 2012
New attacks on the redactable signature scheme introduced by Kundu and Bertino at VLDB '08 are presented and it is shown that schemes with a quadratic complexity become unuseable very fast.
A General Framework for Redactable Signatures and New Constructions
- David Derler, H. C. Pöhls, Kai Samelin, Daniel Slamanig
- Computer Science, MathematicsInternational Conference on Information Security…
- 25 November 2015
This paper presents a general framework covering arbitrary data-structures and even more sophisticated possibilities and introduces the notion of designated redactors, i.e., the signer can give some extra information to selected entities which become redactor to obtain more efficient schemes.
Chameleon-Hashes with Ephemeral Trapdoors And Applications to Invisible Sanitizable Signatures
- J. Camenisch, David Derler, S. Krenn, H. C. Pöhls, Kai Samelin, Daniel Slamanig
- Computer Science, MathematicsIACR Cryptology ePrint Archive
- 28 March 2017
This paper introduces the notion of chameleon-hash functions with ephemeral trapdoors, a formal security model for this new primitive as well as provably secure instantiations, and provides three direct constructions based on standard assumptions.
Redactable Signatures for Independent Removal of Structure and Content
A provably secure redactable signature scheme allowing to independently redact structure and content is presented, and a rigid security model is introduced, including consecutive redaction control, to formalize the required behaviour of the scheme.
On Updatable Redactable Signatures
- H. C. Pöhls, Kai Samelin
- Computer ScienceInternational Conference on Applied Cryptography…
- 10 June 2014
This work presents a provably secure construction in the standard model, which makes use of a novel trapdoor-accumulator and permits creating a signature by merging two redacted messages, if they stem from the same original.
Efficient and Perfectly Unlinkable Sanitizable Signatures without Group Signatures
This work strengthens the standard unlinkability definition by Brzuska et al. at PKC ’10, making it robust against malicious or buggy signers and uses standard digital signatures, which makes them compatible with existing infrastructure.
Length-Hiding Redactable Signatures from One-Way Accumulators in O(n)
This paper proposes two provably secure and length- hiding redactable signature schemes that have a runtime complex of O(n) and protects the integrity of the elements in unordered (multi-)sets, with a storage complexity ofO(1).
Indistinguishability of One-Way Accumulators
It is proved that the construction by Barić and Pfitzmann, presented at Eurocrypt ’97, fulfills the new notion of indistinguishability of one-Way Accumulators, and their accumulator is perfectly indistinguishable.