How to Verify Procedures

Wednesday, March 2, 2016 | 10:20 AM – 11:10 AM | West | Room: 2011

How to verify shuffling and logging procedures are discussed. Topic 1: Efficient Culpably Sound NIZK Shuffle Argument without Random Oracles Authors: Prastudy Mungkas Fauzi and Helger Lipmaa Topic 2: Secure Audit Logs with Verifiable Excerpts Authors: Gunnar Hartung

Participants

Gunnar Hartung Researcher, Karlsruhe Institute of Technology (KIT)

Speaker

Prastudy Mungkas Fauzi Student, Institute of Computer Science, University of Tartu

Speaker