All Issues

Volume 16, 2022

Volume 15, 2021

Volume 14, 2020

Volume 13, 2019

Volume 12, 2018

Volume 11, 2017

Volume 10, 2016

Volume 9, 2015

Volume 8, 2014

Volume 7, 2013

Volume 6, 2012

Volume 5, 2011

Volume 4, 2010

Volume 3, 2009

Volume 2, 2008

Volume 1, 2007

Advances in Mathematics of Communications

Open Access Articles

A survey on functional encryption
Carla Mascia, Massimiliano Sala and Irene Villa
2021 doi: 10.3934/amc.2021049 +[Abstract](1374) +[HTML](374) +[PDF](715.11KB)

Functional Encryption (FE) expands traditional public-key encryption in two different ways: it supports fine-grained access control and allows learning a function of the encrypted data. In this paper, we review all FE classes, describing their functionalities and main characteristics. In particular, we mention several schemes for each class, providing their security assumptions and comparing their properties. To our knowledge, this is the first survey that encompasses the entire FE family.

A coercion-resistant blockchain-based E-voting protocol with receipts
Chiara Spadafora, Riccardo Longo and Massimiliano Sala
2021 doi: 10.3934/amc.2021005 +[Abstract](2053) +[HTML](576) +[PDF](430.83KB)

We propose a decentralized e-voting protocol that is coercion-resistant and vote-selling resistant, while being also completely transparent and not receipt-free. We achieve decentralization using blockchain technology. Because of the properties such as transparency, decentralization, and non-repudiation, blockchain is a fundamental technology of great interest in its own right, and it also has large potential when integrated into many other areas. We prove the security of the protocol under the standard DDH assumption on the underlying prime-order cyclic group (e.g. the group of points of an elliptic curve), as well as under standard assumptions on blockchain robustness.

Marcelo Firer, Sueli I. R. Costa and Vinay A. Vaishampayan
2020, 14(3): i-i doi: 10.3934/amc.2020101 +[Abstract](1191) +[HTML](775) +[PDF](91.27KB)
Ironwood meta key agreement and authentication protocol
Iris Anshel, Derek Atkins, Dorian Goldfeld and Paul E. Gunnells
2021, 15(3): 397-413 doi: 10.3934/amc.2020073 +[Abstract](1855) +[HTML](809) +[PDF](437.39KB)

Number theoretic public-key solutions, currently used in many applications worldwide, will be subject to various quantum attacks, making them less attractive for longer-term use. Certain group theoretic constructs are now showing promise in providing quantum-resistant cryptographic primitives, and may provide suitable alternatives for those looking to address known quantum attacks. In this paper, we introduce a new protocol called a Meta Key Agreement and Authentication Protocol (MKAAP) that has some characteristics of a public-key solution and some of a shared-key solution. Specifically, it has the deployment benefits of a public-key system, allowing two entities that have never met before to authenticate without requiring real-time access to a third-party, but does require secure provisioning of key material from a trusted key distribution system (similar to a symmetric system) prior to deployment. We then describe a specific MKAAP instance, the Ironwood MKAAP, discuss its security, and show how it resists certain quantum attacks such as Shor's algorithm or Grover's quantum search algorithm. We also show Ironwood implemented on several "internet of things" (IoT devices), measure its performance, and show how it performs significantly better than ECC using fewer device resources.

Encryption scheme based on expanded Reed-Solomon codes
Karan Khathuria, Joachim Rosenthal and Violetta Weger
2021, 15(2): 207-218 doi: 10.3934/amc.2020053 +[Abstract](3427) +[HTML](980) +[PDF](373.36KB)

We present a code-based public-key cryptosystem, in which we use Reed-Solomon codes over an extension field as secret codes and disguise it by considering its shortened expanded code over the base field. Considering shortened expanded codes provides a safeguard against distinguisher attacks based on the Schur product. Moreover, without using a cyclic or a quasi-cyclic structure we obtain a key size reduction of nearly \begin{document}$ 45 \% $\end{document} compared to the classic {McE}liece cryptosystem proposed by Bernstein et al.

Complete weight enumerators of a class of linear codes over finite fields
Shudi Yang, Xiangli Kong and Xueying Shi
2021, 15(1): 99-112 doi: 10.3934/amc.2020045 +[Abstract](2431) +[HTML](897) +[PDF](408.68KB)

We investigate a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. These codes have at most three weights and some of them are almost optimal so that they are suitable for applications in secret sharing schemes. This is a supplement of the results raised by Wang et al. (2017) and Kong et al. (2019).

Dual-Ouroboros: An improvement of the McNie scheme
Philippe Gaborit, Lucky Galvez, Adrien Hauteville, Jon-Lark Kim, Myeong Jae Kim and Young-Sik Kim
2020, 14(2): 301-306 doi: 10.3934/amc.2020021 +[Abstract](2537) +[HTML](922) +[PDF](299.97KB)

McNie [8] is a code-based public key encryption scheme submitted to the NIST Post-Quantum Cryptography standardization [10] as a candidate. In this paper, we present Dual-Ouroboros, an improvement of McNie, which can be seen as a dual version of the Ouroboros-R protocol [1], another candidate to the NIST competition. This new improved protocol permits, first, to avoid an attack proposed by Gaborit [7] and second permits to benefit from a reduction security to a standard problem (as the original Ouroboros protocol).

Multi-point codes from the GGS curves
Chuangqiang Hu and Shudi Yang
2020, 14(2): 279-299 doi: 10.3934/amc.2020020 +[Abstract](2106) +[HTML](926) +[PDF](430.21KB)

This paper is concerned with the construction of algebraic-geometric (AG) codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with some rational places, which enables us to study multi-point AG codes. Along this line, we characterize explicitly the Weierstrass semigroups and pure gaps by an exhaustive computation for the basis of Riemann-Roch spaces from GGS curves. In addition, we determine the floor of a certain type of divisor and investigate the properties of AG codes. Multi-point codes with excellent parameters are found, among which, a presented code with parameters \begin{document}$ [216,190,\geqslant 18] $\end{document} over \begin{document}$ \mathbb{F}_{64} $\end{document} yields a new record.

Letters for post-quantum cryptography standard evaluation
Jintai Ding, Sihem Mesnager and Lih-Chung Wang
2020, 14(1): i-i doi: 10.3934/amc.2020012 +[Abstract](2645) +[HTML](774) +[PDF](212.1KB)
Guest editorial
Subhamoy Maitra
2019, 13(4): i-ii doi: 10.3934/amc.2019033 +[Abstract](2354) +[HTML](985) +[PDF](96.27KB)
F. Castro, D. Gomez-Perez, A. Klapper, I. Rubio, M. Sha and A. Tirkel
2017, 11(2): i-i doi: 10.3934/amc.201702i +[Abstract](3679) +[HTML](470) +[PDF](29.6KB)
A. Kerber, M. Kiermaier, R. Laue, M. O. Pavčević and A. Wassermann
2016, 10(3): i-ii doi: 10.3934/amc.201603i +[Abstract](1303) +[PDF](133.8KB)
The present issue of the Advances in Mathematics of Communications is dedicated to the conference

For more information please click the “Full Text” above.
Raquel Pinto, Paula Rocha and Paolo Vettori
2016, 10(1): i-i doi: 10.3934/amc.2016.10.1i +[Abstract](3203) +[PDF](98.6KB)
The $4^{th}$International Castle Meeting on Coding Theory and its Applications (4ICMCTA) took place in the Palmela Castle, Portugal, on September 15--18, 2014. It was organized under the auspices of the Research & Development Center for Mathematics and Applications (CIDMA) from the University of Aveiro. Following in the spirit of the previous installments held at La Mota Castle, Spain, in 1999 and 2008, and at Cardona Castle, Spain, in 2011, the meeting has been a good opportunity for communicating new results, exchanging ideas, strengthening international cooperation, and introducing young researchers into the Coding Theory community.

For more information please click the “Full Text” above.
Zero correlation zone sequence set with inter-group orthogonal and inter-subgroup complementary properties
Zhenyu Zhang, Lijia Ge, Fanxin Zeng and Guixin Xuan
2015, 9(1): 9-21 doi: 10.3934/amc.2015.9.9 +[Abstract](4951) +[PDF](424.1KB)
In this paper, a novel method for constructing complementary sequence set with zero correlation zone (ZCZ) is presented by interleaving and combining three orthogonal matrices. The constructed set can be divided into multiple sequence groups and each sequence group can be further divided into multiple sequence subgroups. In addition to ZCZ properties of sequences from the same sequence subgroup, sequences from different sequence groups are orthogonal to each other while sequences from different sequence subgroups within the same sequence group possess ideal cross-correlation properties, that is, the proposed ZCZ sequence set has inter-group orthogonal (IGO) and inter-subgroup complementary (ISC) properties. Compared with previous methods, the new construction can provide flexible choice for ZCZ width and set size, and the resultant sequences which are called IGO-ISC sequences in this paper can achieve the theoretical bound on the set size for the ZCZ width and sequence length.
The Editors
2014, 8(4): i-ii doi: 10.3934/amc.2014.8.4i +[Abstract](3058) +[PDF](106.0KB)
Every second year, the GEOCRYPT conference brings together researchers from arithmetic geometry and cryptography. After Guadeloupe in 2009 and Corsica in 2011, French Polynesia was the host of its 2013 edition which took place in Punaauia, on the island of Tahiti, October 7-11.
    The main topic of GEOCRYPT has always been the application of pure mathematical techniques to the safety and efficiency of modern communication systems, with particular interest in the fields of arithmetic and algebraic geometry over finite fields, algorithms for finite fields, error correcting codes, cryptology, boolean functions, discrete dynamical systems, and their interactions. The 2013 edition had the honour to feature six invited and eleven contributed talks from renowned international experts presenting strong results recently obtained on topics ranging from pure mathematics to cryptographic algorithms. The GEOCRYPT 2013 Program Committee carefully evaluated the submitted abstracts and selected the best contributions for presentation at the conference.

For more information please click the “Full Text” above.
Marcus Greferath
2013, 7(1): i-i doi: 10.3934/amc.2013.7.1i +[Abstract](3164) +[PDF](97.8KB)
Six years have passed since the founding of Advances in Mathematics of Communications, a journal devoted to all mathematical aspects of information and communications technology. As expressed in the editorial of the inaugural volume, communications technology is omnipresent in contemporary life. However, its ubiquity sometimes obscures the fact that the foundations of communications technology are genuinely mathematical, as are its methods, both analytical and constructive.

For more information please click the "Full Text" above.
Program Committee
2011, 5(2): i-ii doi: 10.3934/amc.2011.5.2i +[Abstract](3365) +[PDF](127.0KB)
The present issue of the Advances in Mathematics of Communications has been dedicated to the conference


(Algebraic Combinatorics and Applications, Designs and Codes)

which took place April 11-18, 2010 in the picturesque village of Thurnau near Bay\-reuth, Germany.
   The purpose of this meeting was to bring together mathematicians from around the world to exchange recent results in all areas of Discrete Mathematics and Mathematics of Communications based on algebraic methods. Special emphasis was placed on the constructive theory of finite structures, in particular on combinatorial designs and codes. The conference was the third of its kind, after the inaugural meeting ALCOMA'99 in Gößweinstein, which was later followed by ALCOMA'05 at the same venue.

  For more information please click the "Full Text" above.

Program Committee
2010, 4(2): i-ii doi: 10.3934/amc.2010.4.2i +[Abstract](2915) +[PDF](42.7KB)
  The Conference on Hyperellptic Curves, Discrete Logarithms, Encryption, etc. took place March 16-20, 2009 in Frutillar, Chile. This event derives its acronym CHiLE 2009 from its Spanish title

Curvas Hiperelĺpticas, Logaritmos discretos, Encriptación, etc.

  The goal of this conference was to bring together researchers working on cryptographic aspects of algebraic geometry from all over the world, and especially from South America. It was hoped that this would help promote the development and expansion of this field of research in South America.

  For more information please click the "Full Text" above.

Marcus Greferath
2007, 1(1): i-ii doi: 10.3934/amc.2007.1.1i +[Abstract](3749) +[PDF](53.2KB)
Almost 60 years have passed since Claude E.~Shannon's celebrated two-part article A Mathematical Theory of Communication appeared in July and October of 1948. With that paper, Shannon founded a discipline, whose wide reach could hardly have been foreseen at the time.
    To commemorate the occasion of the 50th anniversary of the birth of Information Theory as a discipline, the IEEE Transactions on Information Theory published a special issue that included the following statement in its preface:
    With communication engineering at the epicenter of the bombshell, the sensational aftermath of Shannon's paper soon reached Mathematics, Physics, Statistics, Computing, and Cryptology. Even Economics, Biology, Linguistics and other fields in the natural and social sciences felt the ripples of Shannon's new theory.

For more information please click the “Full Text” above.

2021 Impact Factor: 1.015
5 Year Impact Factor: 1.078
2021 CiteScore: 1.8




Email Alert

[Back to Top]