Jan-Åke Larsson

dblp:95/10166 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2011
0000-0002-1082-8325ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Coding theory · 87% Quantum computing and quantum information · 13%
Network and information security
2 papers
Authentication and access control · 42% Cryptographic primitives and cryptanalysis · 42% Cryptographic protocols and secure computation · 16%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
code construction
0.112010
Comments on "New Results on Frame-Proof Codes and Traceability Schemes" · IEEE Trans. Inf. Theory 2010
Coding theory › error-correcting codes › coding bounds
code size bounds
0.112010
Comments on "New Results on Frame-Proof Codes and Traceability Schemes" · IEEE Trans. Inf. Theory 2010
Coding theory
frameproof codes
0.112010
Comments on "New Results on Frame-Proof Codes and Traceability Schemes" · IEEE Trans. Inf. Theory 2010
Authentication and access control › authentication
message authentication
0.112008
Security Aspects of the Authentication Used in Quantum Cryptography · IEEE Trans. Inf. Theory 2008
Cryptographic primitives and cryptanalysis › information-theoretic security
unconditionally secure authentication
0.112008
Security Aspects of the Authentication Used in Quantum Cryptography · IEEE Trans. Inf. Theory 2008
Cryptographic protocols and secure computation
traitor tracing
0.012010
Comments on "New Results on Frame-Proof Codes and Traceability Schemes" · IEEE Trans. Inf. Theory 2010
Quantum computing and quantum information
quantum cryptography
0.012008
Security Aspects of the Authentication Used in Quantum Cryptography · IEEE Trans. Inf. Theory 2008
Quantum computing and quantum information › quantum cryptography
quantum key distribution
0.012008
Security Aspects of the Authentication Used in Quantum Cryptography · IEEE Trans. Inf. Theory 2008

Methods — techniques the papers use, named apart from their topics

lower bound · 0.2security analysis · 0.2protocol analysis · 0.2upper bounds · 0.1upper bound · 0.1
YearPublicationVenuePosition
2011 Gaussian approximation of the LLR distribution for the ML and partial marginalization MIMO detectors
abstract
We derive a Gaussian approximation of the LLR distribution conditioned on the transmitted signal and the channel matrix for the soft-output via partial marginalization MIMO detector. This detector performs exact ML as a special case. Our main results consist of discussing the operational meaning of this approximation and a proof that, in the limit of high SNR, the LLR distribution of interest converges in probability towards a Gaussian distribution.
Mirsad Cirkic, Daniel Persson, Erik G. Larsson, Jan-Åke Larsson
ICASSP4
2010 Comments on "New Results on Frame-Proof Codes and Traceability Schemes"
abstract
The paper "New Results on Frame-Proof Codes and Traceability Schemes" claims to give results for two code classes, frame-proof codes and traceability schemes, in the form of lower bounds on the maximum code size, and explicit code constructions. We will here briefly review the four claims of, noting that the proofs and constructions presented in fail, and that the claims also contradict previously published upper bounds.
Jacob Löfvenberg, Jan-Åke Larsson
IEEE Trans. Inf. Theory2
2008 Security Aspects of the Authentication Used in Quantum Cryptography
abstract
Unconditionally secure message authentication is an important part of quantum cryptography (QC). In this correspondence, we analyze security effects of using a key obtained from QC for authentication purposes in later rounds of QC. In particular, the eavesdropper gains partial knowledge on the key in QC that may have an effect on the security of the authentication in the later round. Our initial analysis indicates that this partial knowledge has little effect on the authentication part of the system, in agreement with previous results on the issue. However, when taking the full QC protocol into account, the picture is different. By accessing the quantum channel used in QC, the attacker can change the message to be authenticated. This, together with partial knowledge of the key, does incur a security weakness of the authentication. The underlying reason for this is that the authentication used, which is insensitive to such message changes when the key is unknown, becomes sensitive when used with a partially known key. We suggest a simple solution to this problem, and stress usage of this or an equivalent extra security measure in QC.
Jorgen Cederlof, Jan-Åke Larsson
IEEE Trans. Inf. Theory2