Titlebook: Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambie; 6th IFIP WG 11.2 Int Ioannis Askoxyla

宣传

Privacy Preservation of User History GraphIn this paper, we propose new ideas to protect user privacy while allowing the use of a user history graph. We define new privacy notions for user history graphs and consider algorithms to generate a privacy-preserving digraph from the original graph.

健忘症

自恋

pacifist

ingrate

collagenase

How to Break EAP-MD5ow table pre-computed with a fixed challenge, which can be done efficiently with great probability through off-line computations. This kind of attack can also be implemented successfully even if the underlying hash function MD5 is replaced with SHA-1 or even SHA-512.

Strength

An Efficient Lattice-Based Secret Sharing Constructionpproximation problems in lattices such as ..-approximate SVP. Different to protocols proposed by Pedersen this scheme uses efficient matrix vector operations instead of exponentiation to verify the secret shares.

吗啡

AMPLE

Ataxia