Publications
Proceedings, refereed
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel
In International Zurich Seminar on Information and Communication, 2022.Status: Accepted
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel
| Afilliation | Communication Systems, Cryptography |
| Project(s) | Information Theory Section |
| Publication Type | Proceedings, refereed |
| Year of Publication | 2022 |
| Conference Name | International Zurich Seminar on Information and Communication |
Proceedings, refereed
On Evaluating Anonymity of Onion Routing
In Selected Areas in Cryptography, 2021.Status: Accepted
On Evaluating Anonymity of Onion Routing
Anonymous communication networks (ACNs) aim to thwart an adversary,
who controls or observes chunks of the communication network,
from determining the respective identities of two communicating parties.
We focus on low-latency ACNs such as Tor, which target a practical level
of anonymity without incurring an unacceptable transmission delay.
While several definitions have been proposed to quantify the level of anonymity
provided by high-latency, message-centric ACNs (such as mix-nets and DC-nets),
this approach is less relevant to Tor, where user--destination pairs communicate
over secure overlay circuits. Moreover, existing evaluation methods of
traffic analysis attacks on Tor appear somewhat ad hoc and fragmented.
We propose a fair evaluation framework for such attacks against onion
routing systems by identifying and discussing the crucial components
for evaluation, including how to consider various adversarial goals,
how to factor in the adversarial ability to collect information relevant
to the attack, and how these components combine to suitable metrics to
quantify the adversary's success.
| Afilliation | Cryptography |
| Project(s) | No Simula project |
| Publication Type | Proceedings, refereed |
| Year of Publication | 2021 |
| Conference Name | Selected Areas in Cryptography |
Tiling of Constellations
In 2021 IEEE International Symposium on Information Theory (ISIT). Melbourne, Australia: IEEE, 2021.Status: Published
Tiling of Constellations
| Afilliation | Cryptography |
| Project(s) | Quantum safe cryptography for the Internet of Things, Simula UiB |
| Publication Type | Proceedings, refereed |
| Year of Publication | 2021 |
| Conference Name | 2021 IEEE International Symposium on Information Theory (ISIT) |
| Pagination | 450-454 |
| Publisher | IEEE |
| Place Published | Melbourne, Australia |
| URL | https://ieeexplore.ieee.org/document/9518129/http://xplorestaging.ieee.o... |
| DOI | 10.1109/ISIT45174.2021.9518129 |
Journal Article
LDPC codes over the BEC: Bounds and decoding algorithms
IEEE Transactions on Communications 67, no. 3 (2019): 1754-1769.Status: Published
LDPC codes over the BEC: Bounds and decoding algorithms
| Afilliation | Cryptography |
| Project(s) | SARDS: Secure and Reliable Distributed Storage Systems |
| Publication Type | Journal Article |
| Year of Publication | 2019 |
| Journal | IEEE Transactions on Communications |
| Volume | 67 |
| Issue | 3 |
| Pagination | 1754-1769 |
| Publisher | ACM/IEEE |
| ISSN | 0090-6778 |
| URL | https://ieeexplore.ieee.org/document/8519768/http://xplorestaging.ieee.o... |
| DOI | 10.1109/TCOMM.2018.2879107 |
Solving non-linear Boolean equation systems by variable elimination
Applicable Algebra in Engineering, Communication and Computing (2019).Status: Published
Solving non-linear Boolean equation systems by variable elimination
In this paper we study Boolean equation systems, and how to eliminate variables from them while bounding the degree of polynomials produced. A procedure for variable elimination is introduced, and we relate the techniques to Gröbner bases and XL methods. We prove that by increasing the degree of the polynomials in the system by one for each variable eliminated, we preserve the solution space, provided that the system satisfies a particular condition. We then estimate how many variables we need to eliminate in order to solve the resulting system by re-linearization, and show that we get complexities lower than the trivial brute-force {\$}{\$}{\backslash}mathcal {\O{\}(2^n){\$}{\$}O(2n)when the system is overdetermined.
| Afilliation | Cryptography |
| Publication Type | Journal Article |
| Year of Publication | 2019 |
| Journal | Applicable Algebra in Engineering, Communication and Computing |
| Date Published | Aug |
| Publisher | Springer |
| ISSN | 1432-0622 |
| URL | https://doi.org/10.1007/s00200-019-00399-7 |
| DOI | 10.1007/s00200-019-00399-7 |
Journal Article
Rate $(n-1)/n$ Systematic Memory Maximum Distance Separable Convolutional Codes
IEEE Transactions on Information Theory 64, no. 4 (2018): 3018-3030.Status: Published
Rate $(n-1)/n$ Systematic Memory Maximum Distance Separable Convolutional Codes
| Afilliation | Cryptography |
| Project(s) | No Simula project |
| Publication Type | Journal Article |
| Year of Publication | 2018 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 64 |
| Issue | 4 |
| Pagination | 3018 - 3030 |
| Date Published | Jan-04-2018 |
| Publisher | ACM/IEEE |
| ISSN | 0018-9448 |
| URL | http://ieeexplore.ieee.org/document/8283508/http://xplorestaging.ieee.or... |
| DOI | 10.1109/TIT.2018.2802540 |
Journal Article
Vendor malware: detection limits and mitigation
IEEE Computer 49, no. 8 (2016): 62-69.Status: Published
Vendor malware: detection limits and mitigation
Computing device vendors can introduce malware that is nearly impossible to detect with known methods, but microservice solutions can limit the negative impact. Malware contains instructions whose execution negatively impacts stakeholders, typically leading to unauthorized access and computation, data theft, loss of privacy, inability to inspect data, or prolonged downtime. A computing system's robustness to malware attacks strongly depends on the ability of the technical system and its stakeholders to either detect inactive malware before it executes or to detect active executing malware as soon as possible, before it causes serious damage. Many previous works discuss the general difficulty of detecting malware, but we focus on the ability of buyers and other legitimate stakeholders to detect malware inserted in computing devices by vendors and other insiders with access to the devices before they reach the buyers.
| Afilliation | Communication Systems |
| Publication Type | Journal Article |
| Year of Publication | 2016 |
| Journal | IEEE Computer |
| Volume | 49 |
| Issue | 8 |
| Pagination | 62-69 |
| Date Published | 08/2016 |
| Publisher | IEEE |
| ISSN | 0018-9162 |
| Keywords | Computer architecture, Computer crime, Computer security, Malware, Software Engineering, Supply chain management |
| DOI | 10.1109/MC.2016.227 |
Proceedings, refereed
Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC
In 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2016). IEEE Press, 2016.Status: Published
Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC
A novel method of low-complexity near-maximum-likelihood (ML) decoding of quasi-cyclic (QC) low-density parity-check (LDPC) codes over the binary erasure channel is presented. The idea is similar to wrap-around decoding of tail-biting convolutional codes. ML decoding is applied to a relatively short window which is cyclically shifted along the received sequence. The procedure is repeated until either all erasures have been corrected, or no new erasures are corrected at a certain round. A new upper bound on the ensemble-average ML decoding error probability for a finite-length row-regular LDPC code family is derived and presented. Furthermore, a few examples of regular and irregular QC LDPC codes are studied by simulations and their performance is compared with the ensemble-average performance. Finally, the impact of the codeword weight and stopping set size spectra on the ML and belief-propagation decoding performance is discussed.
| Afilliation | Communication Systems |
| Project(s) | SARDS: Secure and Reliable Distributed Storage Systems |
| Publication Type | Proceedings, refereed |
| Year of Publication | 2016 |
| Conference Name | 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2016) |
| Pagination | 16-20 |
| Date Published | 09/2016 |
| Publisher | IEEE Press |
Proceedings, refereed
A Coding-based Approach to Robust Shortest-path Routing
In 4th International Castle Meeting on Coding Theory and its Applications (4ICMCTA), 2015.Status: Published
A Coding-based Approach to Robust Shortest-path Routing
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Proceedings, refereed |
| Year of Publication | 2015 |
| Conference Name | 4th International Castle Meeting on Coding Theory and its Applications (4ICMCTA) |
| Notes | Springer CIM Series in Mathematical Sciences |
Talks, contributed
Message merging for routing
In Recent Advances in Practical Network Coding and Distributed Storage, 2015.Status: Published
Message merging for routing
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Talks, contributed |
| Year of Publication | 2015 |
| Location of Talk | Recent Advances in Practical Network Coding and Distributed Storage |
Network coding for cyclic networks
In Mathematical Coding Theory in Multimedia Streaming (15w5150), BIRS, Banff, Canada, 2015.Status: Published
Network coding for cyclic networks
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Talks, contributed |
| Year of Publication | 2015 |
| Location of Talk | Mathematical Coding Theory in Multimedia Streaming (15w5150), BIRS, Banff, Canada |
Talks, invited
Coding for Multipath TCP: Opportunities and Challenges
In Proceedings of the 2nd International NorNet Users Workshop (NNUW-2), 2014.Status: Published
Coding for Multipath TCP: Opportunities and Challenges
| Afilliation | , Communication Systems |
| Publication Type | Talks, invited |
| Year of Publication | 2014 |
| Location of Talk | Proceedings of the 2nd International NorNet Users Workshop (NNUW-2) |
| Keywords | Workshop |
From butterflies to moths: the dark side of wireless network coding
In COST IC 1104 meeting, Palmela, Portugal, September 17, 2014.Status: Published
From butterflies to moths: the dark side of wireless network coding
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Talks, invited |
| Year of Publication | 2014 |
| Location of Talk | COST IC 1104 meeting, Palmela, Portugal, September 17 |
Information exchange for routing protocols
In Information Theory and its Applications (ITA), 2014.Status: Published
Information exchange for routing protocols
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Talks, invited |
| Year of Publication | 2014 |
| Location of Talk | Information Theory and its Applications (ITA) |
The entropy of network topology
In COST IC 1104 meeting, Palmela, Portugal, September 17, 2014.Status: Published
The entropy of network topology
| Afilliation | Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Talks, invited |
| Year of Publication | 2014 |
| Location of Talk | COST IC 1104 meeting, Palmela, Portugal, September 17 |
Journal Article
Near-field passive RFID communication: Channel model and code design
IEEE Transactions on Communications 62, no. 5 (2014): 1716-1727.Status: Published
Near-field passive RFID communication: Channel model and code design
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Journal Article |
| Year of Publication | 2014 |
| Journal | IEEE Transactions on Communications |
| Volume | 62 |
| Issue | 5 |
| Pagination | 1716-1727 |
| Date Published | 05/2014 |
| Publisher | IEEE Press |
Proceedings, refereed
Personnummerering i Norge: Litt anvendt kodeteori og økonomi
In Norsk Informatikk-Konferanse (NIK), 2013.Status: Published
Personnummerering i Norge: Litt anvendt kodeteori og økonomi
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Proceedings, refereed |
| Year of Publication | 2013 |
| Conference Name | Norsk Informatikk-Konferanse (NIK) |
Journal Article
Improved coding techniques for preceded partial-response channels
IEEE Transactions on Information Theory 40, no. 2 (1994): 482-493.Status: Published
Improved coding techniques for preceded partial-response channels
A coset of a convolutional code may be used to generate a zero-run length limited trellis code for a 1-D partial-response channel. The free squared Euclidean distance, dfree2, at the channel output is lower bounded by the free Hamming distance of the convolutional code. The lower bound suggests the use of a convolutional code with maximal free Hamming distance, dmax(R,N), for given rate R and number of decoder states N. In this paper we present cosets of convolutional codes that generate trellis codes with dfree 2>dmax(R,N) for rates 1/5⩽R⩽7/9 and (d free2=dmax(R,N) for R=13/16,29/32,61/64, The tabulated convolutional codes with R⩽7/9 were not optimized for Hamming distance. Instead, a computer search was used to determine cosets of convolutional codes that exploit the memory of the 1-D channel to increase dfree2 at the channel output. The search was limited by only considering cosets with certain structural properties. The R⩾13/16 codes were obtained using a new construction technique for convolutional codes with free Hamming distance 4. Newly developed bounds on the maximum zero-run lengths of cosets were used to ensure a short maximum run length at the 1-D channel output
| Afilliation | , Communication Systems |
| Project(s) | Simula UiB |
| Publication Type | Journal Article |
| Year of Publication | 1994 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 40 |
| Issue | 2 |
| Pagination | 482 - 493 |
| Publisher | IEEE |
| Keywords | Convolutional codes, encoding, telecommunication channels, trellis codes |
| DOI | 10.1109/18.312170 |