PRISMACLOUD

PRISMACLOUD
PRIvacy & Security MAintaining Services in the CLOUD
Chameleon-Hashes with Dual Long-Term Trapdoors and Their Applications

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
Performing Computations on Hierarchically Shared Secrets

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
4th PRISMACLOUD Newsletter - January 2018

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
UniGuard: Protecting Unikernels using Intel SGX

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
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange

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
Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives

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
A Linearly Homomorphic Signature Scheme from Weaker Assumptions

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
Practical Witness Encryption for Algebraic Languages Or How to Encrypt Under Groth-Sahai Proofs

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
Revisiting Proxy Re-Encryption: Forward Secrecy, Improved Security, and Applications

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
Short Double- and N-Times-Authentication-Preventing Signatures from ECDSA and More

27Nov

Short Double- and N-Times-Authentication-Preventing Signatures from ECDSA and More

Double-authentication-preventing signatures (DAPS) are signatures designed with the aim that signing two messages with an identical first part (called address) but different second parts (called payload) allows to publicly extract the secret signing key from two such signatures. A...

Details

Element

Become a Member


Continue