Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Vipin Singh Sehrawat"'
Publikováno v:
IEEE Access, Vol 11, Pp 73235-73267 (2023)
We introduce a novel method to derandomize the learning with errors (LWE) problem by generating deterministic yet sufficiently independent LWE instances that are constructed by using linear regression models, which are generated via (wireless) commun
Externí odkaz:
https://doaj.org/article/5a1ca5ce646e422aa1782cae47b107c5
Publikováno v:
Cryptology and Network Security ISBN: 9783030925475
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::091202ae6a633d5c0cf5590b68e39984
https://doi.org/10.1007/978-3-030-92548-2_18
https://doi.org/10.1007/978-3-030-92548-2_18
Publikováno v:
VNC
Anonymity is a desirable feature for vehicle-to-vehicle (V2V) communications, but it conflicts with other requirements such as non-repudiation and revocation. Existing, pseudonym-based V2V communications schemes rely on certificate generation and sig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dad17da9ee69aac391ac98bb15abbc8
http://arxiv.org/abs/2008.07076
http://arxiv.org/abs/2008.07076
Autor:
Yvo Desmedt, Vipin Singh Sehrawat
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030581497
COCOON
COCOON
Secret sharing provides a means to distribute shares of a secret such that any authorized subset of shares, specified by an access structure, can be pooled together to recompute the secret. The standard secret sharing model requires public access str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57f09f212999f5206f07c15ccfd6089a
https://doi.org/10.1007/978-3-030-58150-3_20
https://doi.org/10.1007/978-3-030-58150-3_20
Secret sharing allows distributing a secret among several parties such that only authorized subsets, specified by an access structure, can reconstruct the secret. Sehrawat and Desmedt (COCOON 2020) introduced hidden access structures, that remain sec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65b10d0b13f348d242d29cf637a87a74
Autor:
Vipin Singh Sehrawat, Yvo Desmedt
Publikováno v:
Cryptology and Network Security ISBN: 9783030315771
CANS
CANS
We define a pseudorandom function (PRF) \(F: \mathcal {K} \times \mathcal {X} \rightarrow \mathcal {Y}\) to be bi-homomorphic when it is fully Key homomorphic and partially Input Homomorphic (KIH), i.e., given \(F(k_1, x_1)\) and \(F(k_2, x_2)\), the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e5bf2cc6dcba8fe7651e1a550b58b74
https://doi.org/10.1007/978-3-030-31578-8_1
https://doi.org/10.1007/978-3-030-31578-8_1