Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Grigory Kabatiansky"'
Publikováno v:
2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3c9553e0ab65d2606695b5c3efff075
https://doi.org/10.1109/sibircon56155.2022.10017094
https://doi.org/10.1109/sibircon56155.2022.10017094
Autor:
Elena Egorova, Grigory Kabatiansky
Publikováno v:
CNS
We consider different models of malicious multiple access channels, especially for binary adder channel and for A-channel, and show how they can be used for the reformulation of digital fingerprinting coding problems. In particular, we propose a new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d2a45f6c028c9443ea92dd830fbf2ae
https://doi.org/10.1109/cns48642.2020.9162248
https://doi.org/10.1109/cns48642.2020.9162248
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
We introduce non-binary IPP set systems with traceability properties that have IPP codes and binary IPP set systems with traceability capabilities as particular cases. We prove an analogue of the Gilbert–Varshamov bound for such systems. Marcel Fer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74bc69965c16212c3b150866f1520360
https://hdl.handle.net/2117/336017
https://hdl.handle.net/2117/336017
Publikováno v:
Code-Based Cryptography ISBN: 9783030540739
CBCrypto
CBCrypto
Unlike most papers devoted to improvements of code-based cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of strengthening which is code-independent. We show (up to some limit) that the security of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53bfac665c40ee87982d628c0f198120
https://doi.org/10.1007/978-3-030-54074-6_3
https://doi.org/10.1007/978-3-030-54074-6_3
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
This is a post-peer-review, pre-copyedit version of an article published in Designs, Codes, and Cryptography. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10623-018-0551-9 We propose a new approach to construct n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff1606c628d31bb27e64ec3a6575ba3c
https://doi.org/10.1007/s10623-018-0551-9
https://doi.org/10.1007/s10623-018-0551-9
Publikováno v:
ISIT
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::714ecbe9c86e2a69931467436315ec40
https://hdl.handle.net/2117/360833
https://hdl.handle.net/2117/360833
Parent-identifying schemes provide a way to identify causes from effects for some information systems such as digital fingerprinting and group testing. In this paper, we consider combinatorial structures for parent-identifying schemes. First, we esta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f470b7793d1fe9aba302e8e2838b4f14
Autor:
Grigory Kabatiansky
Publikováno v:
Codes, Cryptology and Information Security ISBN: 9783030164577
C2SI
C2SI
We give an overview of the most important mathematical results related to different types of tracing traitors schemes, or schemes with identifiable parent property, especially for the case when the scheme’s “length” goes to infinity.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ceb634d4bab2d4ed83fcaed89f9b437
https://doi.org/10.1007/978-3-030-16458-4_21
https://doi.org/10.1007/978-3-030-16458-4_21
Publikováno v:
Designs, Codes and Cryptography. 82:293-299
We prove new lower bounds on the rate of codes for noisy multiple access adder channel and discuss its application to the well-known coin weighing problem in the case when some measurements are incorrect.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46f0eb47dd6b311307118e63c6c7ae86
https://doi.org/10.1007/s10623-016-0228-1
https://doi.org/10.1007/s10623-016-0228-1
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
The final publication is available at Springer via http://dx.doi.org/10.1007/s10623-017-0359-z This paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6883f7a69563eefcab69e2415f2fcd2
https://hdl.handle.net/2117/122239
https://hdl.handle.net/2117/122239