Fault-tolerant aggregate signatures
G Hartung, B Kaidel, A Koch, J Koch… - Public-Key Cryptography …, 2016 - Springer
Aggregate signature schemes allow for the creation of a short aggregate of multiple
signatures. This feature leads to significant reductions of bandwidth and storage space in …
signatures. This feature leads to significant reductions of bandwidth and storage space in …
A survey of topology-transparent scheduling schemes in multi-hop packet radio networks
The aim of topology-transparent scheduling in multi-hop packet radio networks is to find a
schedule for the nodes in such a way that the schedule of the existing nodes need not be …
schedule for the nodes in such a way that the schedule of the existing nodes need not be …
A survey of cover-free families: constructions, applications, and generalizations
TB Idalino, L Moura - International Conference on New Advances in …, 2022 - Springer
Cover-free families (CFFs) have been studied in connection with extremal set theory,
information theory, combinatorial designs, and codes [44, 69, 105, 112]. They are used in …
information theory, combinatorial designs, and codes [44, 69, 105, 112]. They are used in …
White box traitor tracing
M Zhandry - Advances in Cryptology–CRYPTO 2021: 41st Annual …, 2021 - Springer
Traitor tracing aims to identify the source of leaked decryption keys. Since the “traitor” can try
to hide their key within obfuscated code in order to evade tracing, the tracing algorithm …
to hide their key within obfuscated code in order to evade tracing, the tracing algorithm …
[HTML][HTML] Low-weight superimposed codes and related combinatorial structures: Bounds and applications
Abstract A (k, n)-superimposed code is a well known and widely used combinatorial
structure that can be represented by at× n binary matrix such that for any k columns of the …
structure that can be represented by at× n binary matrix such that for any k columns of the …
Star-specific Key-homomorphic PRFs from Learning with Linear Regression
VS Sehrawat, FY Yeo, D Vassilyev - IEEE Access, 2023 - ieeexplore.ieee.org
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 …
generating deterministic yet sufficiently independent LWE instances that are constructed by …
[图书][B] Encryption for digital content
A Kiayias, S Pehlivanoglu - 2010 - books.google.com
Cryptography is an area that traditionally focused on secure communication, authentication
and integrity. In recent times though, there is a wealth of novel fine-tuned cryptographic …
and integrity. In recent times though, there is a wealth of novel fine-tuned cryptographic …
Optimal public key traitor tracing scheme in non-black box model
P Guillot, A Nimour, DH Phan, VC Trinh - … in Africa, Cairo, Egypt, June 22 …, 2013 - Springer
In the context of secure content distribution, the content is encrypted and then broadcasted
in a public channel, each legitimate user is provided a decoder and a secret key for …
in a public channel, each legitimate user is provided a decoder and a secret key for …
Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory
VS Sehrawat, FY Yeo, D Vassilyev - arXiv preprint arXiv:2205.00861, 2022 - arxiv.org
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 …
generating deterministic yet sufficiently independent LWE instances that are constructed by …
A generic view on trace-and-revoke broadcast encryption schemes
D Hofheinz, C Striecks - Topics in Cryptology–CT-RSA 2014: The …, 2014 - Springer
Abstract At Eurocrypt 2011, Wee presented a generalization of threshold public key
encryption, threshold signatures, and revocation schemes arising from threshold extractable …
encryption, threshold signatures, and revocation schemes arising from threshold extractable …