PRISMACLOUD
PRIvacy & Security MAintaining Services in the CLOUD
21Feb
Homomorphic Signature Schemes - A Survey
In the last years, there has been an increasing interest in homomorphic signature schemes. Thus, many schemes have been proposed that are suitable for a lot of different applications. In this work, we overcome the extensive state of the...
Details
08Feb
Efficient Proactive Secret Sharing
Distributed storage allows to outsource a document to the cloud such that multiple users can easily access the file. The protection of the document stored relies on secret sharing, which generates and distributes shares of the document to the...
Details
16Jan
Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation
We introduce the notion of homomorphic proxy re-authenticators, a tool that adds security and verifiability guarantees to multi-user data aggregation scenarios. It allows distinct sources to authenticate their data under their own keys, and a proxy can transform these...
Details
11Jan
Linking-Based Revocation for Group Signatures : A Pragmatic Approach for Efficient Revocation Checks
Group signatures represent an important mechanism for privacy-preserving applications. However, their practical applicability is restricted due to inefficiencies of existing membership revocation mechanisms that place a computational burden and communication overhead on signers and verifiers. In particular, it seems...
Details
10Jan
An Unconditionally Hiding Auditing Procedure for Multi-Party Computations
In this work an unconditionally hiding auditing procedure for computations on documents stored in distributed fashion is introduced. There is only one multi-party computation (MPC) scheme providing auditability which computationally protects the inputs of the computations. Building on this,...
Details
10Jan
Malicious Clients in Distributed Secret Sharing Based Storage Networks
Recent publications combine secret-sharing with byzantine fault-tolerant distribution schemes into safe and secure storage systems. To our knowledge current publications describe chosen algorithms and implementations but do not highlight areas of conflict between secret-sharing and BFT algorithms in a...
Details
10Jan
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Martin R. Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, Tyge Tiessen. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. 22nd International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2016). Hanoi, Vietnam, December...
Details
09Jan
Chameleon-Hashes with Ephemeral Trapdoors And Applications to Invisible Sanitizable Signatures
Jan Camenisch, David Derler, Stephan Krenn, Henrich C. Pöhls, Kai Samelin, and Daniel Slamanig. "Chameleon-Hashes with Ephemeral Trapdoors And Applications to Invisible Sanitizable Signatures". In: PKC 2017, LNCS, Springer. (to appear)
Details
09Jan
Batch-verifiable secret sharing with unconditional privacy
We propose the first batch-verifiable secret sharing scheme with a significant security property, namely that of unconditional privacy. Verifiability and privacy of secret-shared messages are a crucial feature, e.g., in distributed computing scenarios, and verifiable secret sharing schemes with unconditional...
Details
09Jan
2nd PRISMACLOUD Newsletter - November 2016
This is the second issue of the PRISMACLOUD newsletter that will keep you updated about our scientific progress and achievements, about recent events arranged and venues where we were present. In particular, this second issue contains a short description...
Details