Zobrazeno 1 - 10
of 212
pro vyhledávání: '"Yvo Desmedt"'
Autor:
Yvo Desmedt
Publikováno v:
Codes, Cryptology and Information Security ISBN: 9783031330162
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30d5542ec3b8059ed55bd85fce4d785f
https://doi.org/10.1007/978-3-031-33017-9_1
https://doi.org/10.1007/978-3-031-33017-9_1
Autor:
Yvo Desmedt
Publikováno v:
Proceedings of the 19th International Conference on Security and Cryptography.
Autor:
Yvo Desmedt, Fred Piper
Publikováno v:
IEEE Transactions on Information Theory. 65:3990-3997
For 35 years, the cryptographic community has created the impression that anonymous communication is always possible. Chaum’s dining cryptographer’s solution is regarded as achieving unconditional security. Chaum’s MIX approach, namely, applyin
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:
Arkadii Slinko, Yvo Desmedt
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030324292
GameSec
GameSec
The study of Rational Secret Sharing initiated by Halpern and Teague regards the reconstruction of the secretin secret sharing as a game. It was shown that participants (parties) may refuse to reveal their shares and so the reconstruction may fail. M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e8c93ff3dd1750468c1541318dc2072
https://doi.org/10.1007/978-3-030-32430-8_10
https://doi.org/10.1007/978-3-030-32430-8_10
Publikováno v:
Cryptology and Network Security ISBN: 9783030315771
CANS
CANS
Shamir’s threshold secret sharing scheme gives an efficient way to share a secret among n participants such that any k or more of them can reconstruct the secret. For implementation, Shamir’s scheme requires a finite field. Desmedt et al. (AsiaCr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f24c2833be60f6086d68a797a8946a98
https://doi.org/10.1007/978-3-030-31578-8_16
https://doi.org/10.1007/978-3-030-31578-8_16
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
Autor:
Kirill Morozov, Yvo Desmedt
Publikováno v:
Advances in Information and Computer Security ISBN: 9783030268336
IWSEC
IWSEC
Verifiable secret sharing (VSS) allows honest parties to ensure consistency of their shares even if a dealer and/or a subset of parties are corrupt. We focus on perfect VSS, i.e., those providing perfect privacy, correctness and commitment with zero
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c414bb40b73bfae025be5f8636e5f914
https://doi.org/10.1007/978-3-030-26834-3_19
https://doi.org/10.1007/978-3-030-26834-3_19
Publikováno v:
Cryptology and Network Security ISBN: 9783030026400
CANS
CANS
In CANS 2016, Chen, Laing, and Martin proposed an ideal (t, n)-threshold secret sharing scheme (the CLM scheme) based on random linear code. However, in this paper we show that this scheme is essentially same as the one proposed by Karnin, Greene, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e95bcd6fedf283bbe46ca9004b1ade5
https://doi.org/10.1007/978-3-030-02641-7_22
https://doi.org/10.1007/978-3-030-02641-7_22