The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...
This paper proposes new protocols for two goals: authenticated key agreement and authenticated key agreement with key con rmation in the asymmetric public-key setting. A formalm...
This report summarizes the events of the 2nd International Workshop on Privacy, Security, and Trust in KDD, at the 14th ACM SIGKDD International Conference on Knowledge Discovery ...
Francesco Bonchi, Elena Ferrari, Wei Jiang, Bradle...