Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Peter Roelse"'
Publikováno v:
2022 IEEE 12th International Conference on Consumer Electronics (ICCE-Berlin).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d9881fc23060f5956d780805d8ed52e
https://doi.org/10.1109/icce-berlin56473.2022.9937123
https://doi.org/10.1109/icce-berlin56473.2022.9937123
Publikováno v:
2021 IEEE 10th International Conference on Cloud Networking (CloudNet).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f548cbbbf6db56c5f9daad984f6ee27e
https://doi.org/10.1109/cloudnet53349.2021.9657130
https://doi.org/10.1109/cloudnet53349.2021.9657130
Publikováno v:
ICCE-Berlin
Cloud-based payments, virtual car keys, and digital rights management are examples of consumer electronics applications that use secure software. White-box implementations of the Advanced Encryption Standard (AES) are important building blocks of sec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e56b7d443d49c685b6b4492049f8dbbe
https://doi.org/10.1109/icce-berlin50680.2020.9352195
https://doi.org/10.1109/icce-berlin50680.2020.9352195
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030384708
SAC
SAC
Attacks based on DFA are an important threat to the security of white-box AES implementations. DFA typically requires that the output of AES is known. The use of external encodings that obfuscate this output is therefore a straightforward and well-kn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::421a32795359715fd88761b1713cacee
https://doi.org/10.1007/978-3-030-38471-5_24
https://doi.org/10.1007/978-3-030-38471-5_24
Autor:
Shufei He, Peter Roelse
Publikováno v:
ICCE
Speaker de-identification can be used to protect the privacy of a speaker. One class of de-identification schemes uses voice conversion techniques to transform utterances of a source speaker into utterances of a target speaker. This paper presents tw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::715a8ac9b28edb14109ca98cb2d6a01d
https://doi.org/10.1109/icce46568.2020.9043154
https://doi.org/10.1109/icce46568.2020.9043154
Publikováno v:
IEEE Transactions on Information Theory, 59(7), 4230-4242. Institute of Electrical and Electronics Engineers
We construct binary dynamic traitor tracing schemes, where the number of watermark bits needed to trace and disconnect any coalition of pirates is quadratic in the number of pirates, and logarithmic in the total number of users and the error probabil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abadbc417deec4b1e0a5dd51233fb264
https://doi.org/10.1109/tit.2013.2251756
https://doi.org/10.1109/tit.2013.2251756
Autor:
Peter Roelse
Publikováno v:
International Journal of Information Security. 10:173-187
A traitor tracing algorithm can be used to identify content decoders that are used in the process of committing piracy. Fiat and Tassa introduced the concept of dynamic traitor tracing. A dynamic traitor tracing algorithm is based on examining conten
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9889414a2af4333c8a57347f026e6cf5
https://doi.org/10.1007/s10207-011-0126-5
https://doi.org/10.1007/s10207-011-0126-5
Autor:
Peter Roelse
Publikováno v:
Designs, Codes and Cryptography. 42:21-42
This paper presents an iterative construction method for building composite permutations. Its efficiency is based on the concepts of pre-computation and equivalence classes. Equivalence class representatives of permutations on four bits are pre-compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::566e5e0b924ced55e946206b6ab31fba
https://doi.org/10.1007/s10623-006-9012-y
https://doi.org/10.1007/s10623-006-9012-y
Publikováno v:
Mathematics of Computation, 72(244), 1887-1899. American Mathematical Society
The most time-consuming part of the Niederreiter algorithm for factoring univariate polynomials over finite fields is the computation of elements of the nullspace of a certain matrix. This paper describes the so-called ``black-box'' Niederreiter algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e5da376e72814930aafc6e0a3f010a3
https://doi.org/10.1090/s0025-5718-03-01494-7
https://doi.org/10.1090/s0025-5718-03-01494-7
Autor:
Peter Roelse
Publikováno v:
Finite Fields and Their Applications. 5(4):386-392
A new public key cryptosystem was introduced by Wu and Dawson at the Fourth International Conference on Finite Fields (Fq4). This scheme is similar to the McEliece public key cryptosystem, in the sense that it also can be described in terms of linear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8cf13bd0678ef0c0f3ad9433f8cf5959