Symmetrically and Asymmetrically Hard Cryptography

Biryukov, Alex; Perrin, Léo

doi:10.1007/978-3-319-70700-6_15

Cited by 23 publications

(28 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, we design a moderately hard approach to offer the trapdoor to provers. Precisely, with the unified framework of hard cryptographic primitives by Biryukov and Perrin [7], we can ask provers to evaluate a hard function before obtaining the trapdoor. The unified framework brings us even more advantages since the definition has three axes: time, memory, and code.…”

Section: B Our Approach and Contributionmentioning

confidence: 99%

How to Prove Work: With Time or Memory

Su¹,

Larangeira

Tanaka

2022

IEEE Access

View full text Add to dashboard Cite

Proposed by Dwork and Naor (Crypto' 92) as an anti-spam technique, proof-of-work is attracting more attention with the boom of cryptocurrencies. A proof-of-work scheme involves two types of participants, i .e., provers and verifiers. Provers are asked to solve a computational puzzle, and verifiers need to check the solution's correctness. A widely adopted hash-based construction achieves an optimal gap in computational complexity between provers and verifiers. However, in industry, proof-of-work is done by highly dedicated hardware, e.g., "ASIC", which is not generally accessible, let alone the high energy consumption rates. In this work, we turn our eyes back to the original meaning of "proof of work". Under a trusted setting, we propose a framework and its constructions based on computationally hard problems and the unified definition of hard cryptographic primitives by Biryukov and Perrin (Asiacrypt' 17). The new framework enables us to have a proof-of-work scheme with time-hardness or memory-hardness while cutting down power consumption and reducing the impact of dedicated hardware.INDEX TERMS Blockchain, moderate hard primitives, proof-of-work.

show abstract

Section: B Our Approach and Contributionmentioning

confidence: 99%

How to Prove Work: With Time or Memory

Su¹,

Larangeira

Tanaka

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…For everyday Internet communications, generic cryptographic protocols, such as TLS and HTTPs [47], ensure that the communication between the two parties (sender and receiver) are authentic and private. Certain encryption algorithms that underpin these protocols, such as RSA [48,49], Diffie-Hellman [50,51], and elliptic curve [52][53][54], all are based on hard-to-solve mathematical problems and are categorized as asymmetric cryptographic primitives [55]. The time and resources needed to address these issues are prohibitive, which ensures that data encrypted using current encryption algorithms is considered secure.…”

Section: Lattice-based Cryptographymentioning

confidence: 99%

Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms

Asif

2021

IoT

View full text Add to dashboard Cite

The latest quantum computers have the ability to solve incredibly complex classical cryptography equations particularly to decode the secret encrypted keys and making the network vulnerable to hacking. They can solve complex mathematical problems almost instantaneously compared to the billions of years of computation needed by traditional computing machines. Researchers advocate the development of novel strategies to include data encryption in the post-quantum era. Lattices have been widely used in cryptography, somewhat peculiarly, and these algorithms have been used in both; (a) cryptoanalysis by using lattice approximation to break cryptosystems; and (b) cryptography by using computationally hard lattice problems (non-deterministic polynomial time hardness) to construct stable cryptographic functions. Most of the dominant features of lattice-based cryptography (LBC), which holds it ahead in the post-quantum league, include resistance to quantum attack vectors, high concurrent performance, parallelism, security under worst-case intractability assumptions, and solutions to long-standing open problems in cryptography. While these methods offer possible security for classical cryptosytems in theory and experimentation, their implementation in energy-restricted Internet-of-Things (IoT) devices requires careful study of regular lattice-based implantation and its simplification in lightweight lattice-based cryptography (LW-LBC). This streamlined post-quantum algorithm is ideal for levelled IoT device security. The key aim of this survey was to provide the scientific community with comprehensive information on elementary mathematical facts, as well as to address real-time implementation, hardware architecture, open problems, attack vectors, and the significance for the IoT networks.

show abstract

“…The hardness of these algorithms lies in their mathematical operations that are difficult to solve. All the aforementioned algorithms are termed asymmetric cryptographic primitives [96]. The solutions to these modern algorithms require enormous computational resources and time; therefore, they are highly secure algorithms if they have quantum computers to solve their existing asymmetric cryptographic primitives [97,98].…”

Section: ) Lattice-based Cryptographymentioning

confidence: 99%