scholarly journals Scabbard: a suite of efficient learning with rounding key-encapsulation mechanisms

Author(s):  
Jose Maria Bermudo Mera ◽  
Angshuman Karmakar ◽  
Suparna Kundu ◽  
Ingrid Verbauwhede

In this paper, we introduce Scabbard, a suite of post-quantum keyencapsulation mechanisms. Our suite contains three different schemes Florete, Espada, and Sable based on the hardness of module- or ring-learning with rounding problem. In this work, we first show how the latest advancements on lattice-based cryptographycan be utilized to create new better schemes and even improve the state-of-the-art on post-quantum cryptography. We put particular focus on designing schemes that can optimally exploit the parallelism offered by certain hardware platforms and are also suitable for resource constrained devices. We show that this can be achieved without compromising the security of the schemes or penalizing their performance on other platforms.To substantiate our claims, we provide optimized implementations of our three new schemes on a wide range of platforms including general-purpose Intel processors using both portable C and vectorized instructions, embedded platforms such as Cortex-M4 microcontrollers, and hardware platforms such as FPGAs. We show that on each platform, our schemes can outperform the state-of-the-art in speed, memory footprint, or area requirements.

2021 ◽  
Vol 15 (5) ◽  
pp. 1-32
Author(s):  
Quang-huy Duong ◽  
Heri Ramampiaro ◽  
Kjetil Nørvåg ◽  
Thu-lan Dam

Dense subregion (subgraph & subtensor) detection is a well-studied area, with a wide range of applications, and numerous efficient approaches and algorithms have been proposed. Approximation approaches are commonly used for detecting dense subregions due to the complexity of the exact methods. Existing algorithms are generally efficient for dense subtensor and subgraph detection, and can perform well in many applications. However, most of the existing works utilize the state-or-the-art greedy 2-approximation algorithm to capably provide solutions with a loose theoretical density guarantee. The main drawback of most of these algorithms is that they can estimate only one subtensor, or subgraph, at a time, with a low guarantee on its density. While some methods can, on the other hand, estimate multiple subtensors, they can give a guarantee on the density with respect to the input tensor for the first estimated subsensor only. We address these drawbacks by providing both theoretical and practical solution for estimating multiple dense subtensors in tensor data and giving a higher lower bound of the density. In particular, we guarantee and prove a higher bound of the lower-bound density of the estimated subgraph and subtensors. We also propose a novel approach to show that there are multiple dense subtensors with a guarantee on its density that is greater than the lower bound used in the state-of-the-art algorithms. We evaluate our approach with extensive experiments on several real-world datasets, which demonstrates its efficiency and feasibility.


1987 ◽  
Vol 60 (3) ◽  
pp. 381-416 ◽  
Author(s):  
B. S. Nau

Abstract The understanding of the engineering fundamentals of rubber seals of all the various types has been developing gradually over the past two or three decades, but there is still much to understand, Tables V–VII summarize the state of the art. In the case of rubber-based gaskets, the field of high-temperature applications has scarcely been touched, although there are plans to initiate work in this area both in the U.S.A. at PVRC, and in the U.K., at BHRA. In the case of reciprocating rubber seals, a broad basis of theory and experiment has been developed, yet it still is not possible to design such a seal from first principles. Indeed, in a comparative series of experiments run recently on seals from a single batch, tested in different laboratories round the world to the same test procedure, under the aegis of an ISO working party, a very wide range of values was reported for leakage and friction. The explanation for this has still to be ascertained. In the case of rotary lip seals, theories and supporting evidence have been brought forward to support alternative hypotheses for lubrication and sealing mechanisms. None can be said to have become generally accepted, and it remains to crystallize a unified theory.


Resources ◽  
2020 ◽  
Vol 9 (2) ◽  
pp. 15
Author(s):  
Juan Uribe-Toril ◽  
José Luis Ruiz-Real ◽  
Jaime de Pablo Valenciano

Sustainability, local development, and ecology are keywords that cover a wide range of research fields in both experimental and social sciences. The transversal nature of this knowledge area creates synergies but also divergences, making a continuous review of the existing literature necessary in order to facilitate research. There has been an increasing number of articles that have analyzed trends in the literature and the state-of-the-art in many subjects. In this Special Issue of Resources, the most prestigious researchers analyzed the past and future of Social Sciences in Resources from an economic, social, and environmental perspective.


Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5165
Author(s):  
Chen Dong ◽  
Yi Xu ◽  
Ximeng Liu ◽  
Fan Zhang ◽  
Guorong He ◽  
...  

Diverse and wide-range applications of integrated circuits (ICs) and the development of Cyber Physical System (CPS), more and more third-party manufacturers are involved in the manufacturing of ICs. Unfortunately, like software, hardware can also be subjected to malicious attacks. Untrusted outsourced manufacturing tools and intellectual property (IP) cores may bring enormous risks from highly integrated. Attributed to this manufacturing model, the malicious circuits (known as Hardware Trojans, HTs) can be implanted during the most designing and manufacturing stages of the ICs, causing a change of functionality, leakage of information, even a denial of services (DoS), and so on. In this paper, a survey of HTs is presented, which shows the threatens of chips, and the state-of-the-art preventing and detecting techniques. Starting from the introduction of HT structures, the recent researches in the academic community about HTs is compiled and comprehensive classification of HTs is proposed. The state-of-the-art HT protection techniques with their advantages and disadvantages are further analyzed. Finally, the development trends in hardware security are highlighted.


2021 ◽  
Vol 54 (5) ◽  
pp. 1-39
Author(s):  
Rob Ashmore ◽  
Radu Calinescu ◽  
Colin Paterson

Machine learning has evolved into an enabling technology for a wide range of highly successful applications. The potential for this success to continue and accelerate has placed machine learning (ML) at the top of research, economic, and political agendas. Such unprecedented interest is fuelled by a vision of ML applicability extending to healthcare, transportation, defence, and other domains of great societal importance. Achieving this vision requires the use of ML in safety-critical applications that demand levels of assurance beyond those needed for current ML applications. Our article provides a comprehensive survey of the state of the art in the assurance of ML , i.e., in the generation of evidence that ML is sufficiently safe for its intended use. The survey covers the methods capable of providing such evidence at different stages of the machine learning lifecycle , i.e., of the complex, iterative process that starts with the collection of the data used to train an ML component for a system, and ends with the deployment of that component within the system. The article begins with a systematic presentation of the ML lifecycle and its stages. We then define assurance desiderata for each stage, review existing methods that contribute to achieving these desiderata, and identify open challenges that require further research.


Author(s):  
P. Branco ◽  
L. Fiolhais ◽  
M. Goulão ◽  
P. Martins ◽  
P. Mateus ◽  
...  

Oblivious Transfer (OT) is a fundamental primitive in cryptography, supporting protocols such as Multi-Party Computation and Private Set Intersection (PSI), that are used in applications like contact discovery, remote diagnosis and contact tracing. Due to its fundamental nature, it is utterly important that its execution is secure even if arbitrarily composed with other instances of the same, or other protocols. This property can be guaranteed by proving its security under the Universal Composability model. Herein, a 3-round Random Oblivious Transfer (ROT) protocol is proposed, which achieves high computational efficiency, in the Random Oracle Model. The security of the protocol is based on the Ring Learning With Errors assumption (for which no quantum solver is known). ROT is the basis for OT extensions and, thus, achieves wide applicability, without the overhead of compiling ROTs from OTs. Finally, the protocol is implemented in a server-class Intel processor and four application-class ARM processors, all with different architectures. The usage of vector instructions provides on average a 40% speedup. The implementation shows that our proposal is at least one order of magnitude faster than the state-of-the-art, and is suitable for a wide range of applications in embedded systems, IoT, desktop, and servers. From a memory footprint perspective, there is a small increase (16%) when compared to the state-of-the-art. This increase is marginal and should not prevent the usage of the proposed protocol in a multitude of devices. In sum, the proposal achieves up to 37k ROTs/s in an Intel server-class processor and up to 5k ROTs/s in an ARM application-class processor. A PSI application, using the proposed ROT, is up to 6.6 times faster than related art.


Author(s):  
K. Liagkouras ◽  
K. Metaxiotis

This paper provides a systematic study of the technologies and algorithms associated with the implementation of multiobjective evolutionary algorithms (MOEAs) for the solution of the portfolio optimization problem. Based on the examination of the state-of-the art we provide the best practices for dealing with the complexities of the constrained portfolio optimization problem (CPOP). In particular, rigorous algorithmic and technical treatment is provided for the efficient incorporation of a wide range of real-world constraints into the MOEAs. Moreover, we address special configuration issues related to the application of MOEAs for solving the CPOP. Finally, by examining the state-of-the-art we identify the most appropriate performance metrics for the evaluation of the relevant results from the implementation of the MOEAs to the solution of the CPOP.


1982 ◽  
Vol 13 (1) ◽  
pp. 75-78
Author(s):  
Thomas J. Cooney

I found the book Selected Issues in Mathematics Education, jointly published with the National Society for the Study of Education, to be a worthy candidate for one's library. It provides interesting perspectives on a wide range of centrally important topics without getting bogged down in “disease of the week” issues that are parochial in nature. The book is not issue oriented in the sense of presenting various positions for the reader to consider and judge. Many of the chapters convey the authors' views of the state of the art in a particular research area. In some sense, the book could be a companion volume to NCTM's professional reference, Research in Mathematics Education. Still, if one is willing to look beyond what the title suggests, Selected Issues generally makes for good reading, as several authors are willing to share their insights into some rather knotty problems that are likely to be with our profession for some time.


2003 ◽  
Vol 31 (5) ◽  
pp. 971-972 ◽  
Author(s):  
S.E. Harding ◽  
P. O'Shea

An overview is given of a stimulating Meeting held at the University of Nottingham in June 2003 focusing on molecular interactions occurring in membranes or ‘2D’ and those occurring in aqueous solution or ‘3D’. It was held jointly between the Biochemical Society and the British Biophysical Society. The 80 or so delegates who attended benefitted from an exciting exchange of ideas between researchers from a wide spectrum of backgrounds. It is hoped the collection of papers which follow this Introductory paper will provide a useful summary of the state of the art and help stimulate collaboration across the wide range of disciplines represented.


Data ◽  
2021 ◽  
Vol 6 (2) ◽  
pp. 18
Author(s):  
Deepani B. Guruge ◽  
Rajan Kadel ◽  
Sharly J. Halder

In recent years, education institutions have offered a wide range of course selections with overlaps. This presents significant challenges to students in selecting successful courses that match their current knowledge and personal goals. Although many studies have been conducted on Recommender Systems (RS), a review of methodologies used in course RS is still insufficiently explored. To fill this literature gap, this paper presents the state of the art of methodologies used in course RS along with the summary of the types of data sources used to evaluate these techniques. This review aims to recognize emerging trends in course RS techniques in recent research literature to deliver insights for researchers for further investigation. We provide a systematic review process followed by research findings on the current methodologies implemented in different course RS in selected research journals such as: collaborative, content-based, knowledge-based, Data Mining (DM), hybrid, statistical and Conversational RS (CRS). This study analyzed publications between 2016 and June 2020, in three repositories; IEEE Xplore, ACM, and Google Scholar. These papers were explored and classified based on the methodology used in recommending courses. This review has revealed that there is a growing popularity in hybrid course RS and followed by DM techniques in recent publications. However, few CRS-based course RS were present in the selected publications. Finally, we discussed future avenues based on the research outcome, which might lead to next-generation course RS.


Sign in / Sign up

Export Citation Format

Share Document