PRISMACLOUD

PRISMACLOUD
PRIvacy & Security MAintaining Services in the CLOUD
Privacy-Aware Authentication in the Internet of Things

23Sep

Privacy-Aware Authentication in the Internet of Things

Hannes Groß, Marko Hölbl, Daniel Slamanig, Raphael Spreitzer. "Privacy-Aware Authentication in the Internet of Things", Cryptology and Network Security, 14th International Conference, CANS 2015, Marrakesh, Morocco, December 8-12. 2015.

Details
ARCHISTAR: Towards Secure and Robust Cloud Based Data Sharing

23Sep

ARCHISTAR: Towards Secure and Robust Cloud Based Data Sharing

Thomas Lorünser, Andreas Happe, and Daniel Slamanig. "ARCHISTAR: Towards Secure and Robust Cloud Based Data Sharing". IEEE 7th International Conference on Cloud Computing Technology and Science, CloudCom 2015, Vancouver, Canada, November 30 - December 3, 2015.

Details
Towards a New Paradigm for Privacy and Security in Cloud Services

22Sep

Towards a New Paradigm for Privacy and Security in Cloud Services

Thomas Lorünser, Charles Bastos Rodriguez, Denise Demirel, Simone Fischer-Hübner, Thomas Groß, Thomas Länger, Mathieu des Noes, Henrich C. Pöhls, Boris Rozenberg, and Daniel Slamanig. "Towards a New Paradigm for Privacy and Security in Cloud Services". In New LEIT projects...

Details
Signatures and Efficient Proofs on Committed Graphs and NP-Statements

20Sep

Signatures and Efficient Proofs on Committed Graphs and NP-Statements

Author Thomas Gross (School of Computing Science, Newcastle University, UK) Abstract Digital signature schemes are a foundational building block enabling integrity and non-repudiation. We propose a graph signature scheme and corresponding proofs that allow a prover (1) to obtain a signature...

Details
A New Approach To Efficient Revocable Attribute-Based Anonymous Credentials

28Aug

A New Approach To Efficient Revocable Attribute-Based Anonymous Credentials

David Derler, Christian Hanser, and Daniel Slamanig. "A New Approach To Efficient Revocable Attribute-Based Anonymous Credentials". In Cryptography and Coding - 15th IMA International Conference, IMACC 2015, Oxford, UK, December 15-17, 2015.

Details
Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction for Strongly Private Schemes

26Aug

Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction for Strongly Private Schemes

David Derler and Daniel Slamanig. "Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction for Strongly Private Schemes". In Provable Security - 9th International Conference, ProvSec 2015. Kanazawa, Japan, November 24-26, 2015.

Details
Stronger Security for Sanitizable Signatures

17Aug

Stronger Security for Sanitizable Signatures

Stephan Krenn, Kai Samelin, and Dieter Sommer, "Stronger Security Definition for Sanitizable Signatures", Data Privacy Management - DPM 2015, Vienna, Austria, September 21–22, 2015.

Details
Formal Treatment of Privacy-Enhancing Credential Systems

14Jul

Formal Treatment of Privacy-Enhancing Credential Systems

Jan Camenisch, Stephan Krenn, Anja Lehmann, Gert L. Mikkelsen, Gregory Neven, and Michael Ø. Pedersen, "Formal Treatment of Privacy-Enhancing Credential Systems", Selected Areas in Cryptography - SAC 2015, Sackville, New Brunswick, Canada, August 12–14, 2015.

Details
Accountable Redactable Signatures

19Jun

Accountable Redactable Signatures

Henrich C. Pöhls and Kai Samelin, "Accountable Redactable Signatures "10th International Conference on Availability, Reliability and Security, ARES 2015, IEEE, Toulouse, France, August 24–28, 2015.

Details
Verifiably Encrypted Signatures: Security Revisited and a New Construction

19Jun

Verifiably Encrypted Signatures: Security Revisited and a New Construction

Christian Hanser, Max Rabkin and Dominique Schröder, "Verifiably Encrypted Signatures: Security Revisited and a New Construction." 20th European Symposium on Research in Computer Security, Computer Security - ESORICS 2015, volume 5922 of LNCS, Springer-Verlag, Vienna, Austria, September 21-25, 2015.

Details

Element

Become a Member


Continue