Blog Standard

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...


David Derler presented PRISMACLOUD Results at Real World Crypto

On January 12th, David Derler (TU Graz) gave a talk on recent results obtained within Prismacloud at the Real World Crypto Symposium in Zurich, Switzerland. The talk was about a novel primitive termed Bloom filter encryption and its applications...


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...


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...


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...


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...


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...



Become a Member