Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Salmasizadeh, Mahmoud"'
We study masked implementation's security when an adversary randomly probes each of its internal variables, intending to recover non-trivial knowledge about its secrets. We introduce a novel metric called Secret Recovery Probability (SRP) for assessi
Externí odkaz:
http://arxiv.org/abs/2012.10876
Private Set Intersection (PSI) is a vital cryptographic technique used for securely computing common data of different sets. In PSI protocols, often two parties hope to find their common set elements without needing to disclose their uncommon ones. I
Externí odkaz:
http://arxiv.org/abs/2004.03976
Publikováno v:
In Information Sciences May 2021 557:108-129
A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless
Externí odkaz:
http://arxiv.org/abs/1202.1387
A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via a public channel where three users can observe i.i.d. outputs o
Externí odkaz:
http://arxiv.org/abs/1004.0799
In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and Charlie inten
Externí odkaz:
http://arxiv.org/abs/1004.0798
In this paper we try to unify the frameworks of definitions of semantic security, indistinguishability and non-malleability by defining semantic security in comparison based framework. This facilitates the study of relations among these goals against
Externí odkaz:
http://arxiv.org/abs/cs/0508110
In this paper, firstly we propose two new concepts concerning the notion of key escrow encryption schemes: provable partiality and independency. Roughly speaking we say that a scheme has provable partiality if existing polynomial time algorithm for r
Externí odkaz:
http://arxiv.org/abs/cs/0505055
Publikováno v:
In Information Sciences July 2018 451-452:253-270
Publikováno v:
ISeCure; Nov2023, Vol. 15 Issue 3, p1-13, 13p