PRISMACLOUD
PRIvacy & Security MAintaining Services in the CLOUD
09Mar
Einsetzbare Kryptografie für die Cloud
Title Einsetzbare Kryptografie für die Cloud Authors Henrich C. Pöhls (University of Passau) and Thomas Länger (University of Laussane) Abstract tba Journal Zeitschrift für Datenrecht und informationssicherheit (digma). Jahrgang 17, Heft 1, März 2017 [Download]
Details
05Mar
Chameleon-Hashes with Dual Long-Term Trapdoors and Their Applications
A chameleon-hash behaves likes a standard collision-resistant hash function for outsiders. If, however, a trapdoor is known, arbitrary collisions can be found. Chameleon-hashes with ephemeral trapdoors (CHET; Camenisch et al., PKC 17) allow prohibiting that the holder of the...
Details
05Mar
Performing Computations on Hierarchically Shared Secrets
Hierarchical secret sharing schemes distribute a message to a set of shareholders with different reconstruction capabilities. In distributed storage systems, this is an important property because it allows to grant more reconstruction capability to better performing storage servers and...
Details
29Jan
4th PRISMACLOUD Newsletter - January 2018
The fourth issue of the PRISMACLOUD newsletter that will keep you updated about our scientific progress and achievements, and future events where we will participate. In particular, this fourth issue contains a short description of the PRISMACLOUD Services, a...
Details
16Jan
UniGuard: Protecting Unikernels using Intel SGX
Computations executed in lightweight virtual machines called unikernels have a minimal attack surface and improved performance. However, unikernels are still prone to leaking information to the operating system or to the hypervisor that hosts them. This is attributed to...
Details
16Jan
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
Forward secrecy is considered an essential design goal of modern key establishment (KE) protocols, such as TLS 1.3, for example. Furthermore, efficiency considerations such as zero round-trip time (0-RTT), where a client is able to send cryptographically protected payload...
Details
16Jan
Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives
In this paper we address the construction of privacy-friendly cryptographic primitives for the post-quantum era and in particular accumulators with zero-knowledge membership proofs and ring signatures. This is an important topic as it helps to protect the privacy of users...
Details
08Jan
A Linearly Homomorphic Signature Scheme from Weaker Assumptions
In delegated computing, prominent in the context of cloud computing, guaranteeing both the correctness and authenticity of computations is of critical importance. Homomorphic signatures can be used as cryptographic solutions to this problem. In this paper we solve the...
Details
08Jan
Practical Witness Encryption for Algebraic Languages Or How to Encrypt Under Groth-Sahai Proofs
Witness encryption (WE) is a recent powerful encryption paradigm, which allows to encrypt a message using the description of a hard problem (a word in an NP-language) and someone who knows a solution to this problem (a witness) is...
Details
14Dec
Revisiting Proxy Re-Encryption: Forward Secrecy, Improved Security, and Applications
We revisit the notion of proxy re-encryption (PRE), an enhanced public-key encryption primitive envisioned by Blaze et al. (EUROCRYPT 1998) and formalized by Ateniese et al. (NDSS 2005). PRE allows to craft fine-granular re-encryption keys in order to equip...
Details