SECPID 2017 at ARES Conference 2017
PRISMACLOUD and its partner project CREDENTIAL are organizing a Workshop on Security, Privacy, and Identity Management in the Cloud at this year's ARES conference, the 12th International Conference on Availability, Reliability and Security on August 29 - September 2, 2017 in...
Details
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
ISO/IEC JTC1 SC27 WG4 Liaison
PRISMACLOUD has a liaison with ISO/IEC JTC1/SC27 WG4 (“Liaison Category C”), which enables us to make effective technical contribution and participate actively at the working group or project level. We want to participate in the development of ISO/IEC 19086-4,...
Details 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 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
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 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 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 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
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