Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark)

2020 ◽  
pp. 179-209
Author(s):  
Ryo Nishimaki
Keyword(s):  
Public Key ◽  
Cryptographic Primitives

scholarly journals polarRLCE: A New Code-Based Cryptosystem Using Polar Codes

2019 ◽  
Vol 2019 ◽  
pp. 1-10
Author(s):  
Jingang Liu ◽  
Yongge Wang ◽  
Zongxiang Yi ◽  
Zhiqiang Lin
Keyword(s):  
Coding Theory ◽  
Public Key ◽  
Security Level ◽  
Polar Codes ◽  
Encryption Scheme ◽  
Cryptographic Primitives ◽  
The Public ◽  
Security Challenges ◽  
High Security Level ◽  
Code Based Cryptography

Security challenges brought about by the upcoming 5G era should be taken seriously. Code-based cryptography leverages difficult problems in coding theory and is one of the main techniques enabling cryptographic primitives in the postquantum scenario. In this work, we propose the first efficient secure scheme based on polar codes (i.e., polarRLCE) which is inspired by the RLCE scheme, a candidate for the NIST postquantum cryptography standardization in the first round. In addition to avoiding some weaknesses of the RLCE scheme, we show that, with the proper choice of parameters, using polar codes, it is possible to design an encryption scheme to achieve the intended security level while retaining a reasonably small public key size. In addition, we also present a KEM version of the polarRLCE scheme that can attain a negligible decryption failure rate within the corresponding security parameters. It is shown that our proposal enjoys an apparent advantage to decrease the public key size, especially on the high-security level.

Bitcoin

2020 ◽  
pp. 241-258
Author(s):  
Andreas Bolfing
Keyword(s):  
Elliptic Curve Cryptography ◽  
Peer To Peer ◽  
Third Party ◽  
Public Key ◽  
Cryptographic Primitives ◽  
The Public ◽  
A Chain ◽  
Basic Ideas ◽  
Electronic Coin ◽  
Electronic Payment System

Bitcoin was proposed by Nakamoto (2008) as the first electronic payment system, which fully relies on cryptographic primitives in order to work over a purely peer-to-peer system, where everyone can participate in spending funds to other users without the need for a trusted third party. This chapter first introduces the basic ideas of Satoshi Nakamoto, who defined an electronic coin as a chain of digital signatures. It explains how the addresses in Bitcoin are derived, and how the elliptic curve cryptography (ECC) key pair is used in order to transact funds from one user to another. For this, it shows how the transactions are constructed in Bitcoin, based on the most common transaction, which is the Pay-to-Public-Key-Hash transaction. The last section then shows how the transactions are permanently stored in the public ledger, the blockchain, and how the miners solve the Proof-of-Work in order to safeguard the records.

Cryptographic Primitives

2020 ◽  
pp. 57-134
Author(s):  
Andreas Bolfing
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Digital Signature ◽  
Discrete Logarithm ◽  
Public Key ◽  
Public Key Encryption ◽  
Cryptographic Primitives ◽  
Digital Signature Algorithm ◽  
Digital Signature Scheme ◽  
Current Standards

This chapter provides a very detailed introduction to cryptography. It first explains the cryptographic basics and introduces the concept of public-key encryption which is based on one-way and trapdoor functions, considering the three major public-key encryption families like integer factorization, discrete logarithm and elliptic curve schemes. This is followed by an introduction to hash functions which are applied to construct Merkle trees and digital signature schemes. As modern cryptoschemes are commonly based on elliptic curves, the chapter then introduces elliptic curve cryptography which is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). It considers the hardness of the ECDLP and the possible attacks against it, showing how to find suitable domain parameters to construct cryptographically strong elliptic curves. This is followed by the discussion of elliptic curve domain parameters which are recommended by current standards. Finally, it introduces the Elliptic Curve Digital Signature Algorithm (ECDSA), the elliptic curve digital signature scheme.

scholarly journals Efficient and Provable Secure Pairing-Free Security-Mediated Identity-Based Identification Schemes

2014 ◽  
Vol 2014 ◽  
pp. 1-14
Author(s):  
Ji-Jian Chin ◽  
Syh-Yuan Tan ◽  
Swee-Huay Heng ◽  
Raphael C.-W. Phan
Keyword(s):  
Discrete Logarithm ◽  
Bilinear Pairings ◽  
Public Key ◽  
Encryption Scheme ◽  
Secret Key ◽  
Cryptographic Primitives ◽  
Main Motivation ◽  
Identification Scheme ◽  
Identification Schemes ◽  
Identity Based

Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user’s secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions.

Securing Digital Image with Authentication Code

2014 ◽  
pp. 203-215
Author(s):  
Siva Charan Muraharirao ◽  
Manik Lal Das
Keyword(s):  
Digital Watermarking ◽  
Digital Image ◽  
Digital Signature ◽  
Image Authentication ◽  
Public Key ◽  
Authentication Codes ◽  
Authentication Code ◽  
Cryptographic Primitives ◽  
Partial Encryption ◽  
Data Authentication

The recent advances in multimedia technology demand protection of digital images from unintentional manipulation for content integrity, copyright, and ownership. Digital watermarking technique has wide acceptance in the industry for anti-piracy, ownership verification, and digital image authentication. There have been a large number of schemes in the literature proposed for digital watermarking using non-cryptographic and cryptographic primitives. Use of Least Significant Bits (LSB) is one of the oldest but classical approaches for digital image authentication. Although LSB approach is efficient, it does not provide adequate security. Cryptographic primitives such as hash function, digital signature, and message authentication codes have been used in several applications including multimedia for data authentication. Digital signature-based image authentication provides strong security, but the approach requires managing public key infrastructure, which is a costly operation. Partial data protection is also an optimal approach for protecting important data while leaving unimportant data unprotected. Considering security weakness of the LSB-based approach and cost overhead of the public key-based approach, the authors present in this chapter a digital image authentication scheme using LSB, keyed hash, and partial encryption. They show that the proposed watermarking scheme is secure and efficient in comparison to other related schemes.

Post-Quantum Blockchains

2020 ◽  
pp. 279-290
Author(s):  
Andreas Bolfing
Keyword(s):  
Digital Signature ◽  
Large Scale ◽  
Public Key ◽  
Quantum Computers ◽  
Cryptographic Primitives ◽  
Signature Schemes

Chapter 10 deals with the fact that quantum computers will break all current practical digital signature schemes once large-scale quantum computers become reality. The chapter starts with an outline of the major cryptographic primitives that are considered to be quantum-safe and compare their efficiency and usability for blockchain networks. For this, it compares the basic factors of the most popular classical public-key schemes and some chosen post-quantum approaches. This is followed by an introduction to hash-based cryptosystems. Based on Lamport-Diffie one-time signatures, it shows how hash-based signature schemes work and how they can be transformed to multi-signature schemes.

Watermarking Public-Key Cryptographic Primitives

2019 ◽  
pp. 367-398 ◽  
Author(s):  
Rishab Goyal ◽  
Sam Kim ◽  
Nathan Manohar ◽  
Brent Waters ◽  
David J. Wu
Keyword(s):  
Public Key ◽  
Cryptographic Primitives

Updatable Lossy Trapdoor Functions Under Consecutive Leakage

2019 ◽  
Vol 63 (4) ◽  
pp. 648-656
Author(s):  
Meijuan Huang ◽  
Bo Yang ◽  
Mingwu Zhang ◽  
Lina Zhang ◽  
Hongxia Hou
Keyword(s):  
Provable Security ◽  
Public Key ◽  
Encryption Scheme ◽  
Security Model ◽  
Public Key Encryption ◽  
Cryptographic Primitives ◽  
Trapdoor Functions ◽  
Leakage Resilient ◽  
Trapdoor Function ◽  
Lossy Trapdoor Functions

Abstract Lossy trapdoor functions (LTFs), introduced by Peikert and Waters (STOC’08), have already been found to be a very useful tool in constructing complex cryptographic primitives in a black-box manner, such as one-way trapdoor functions, deterministic public-key encryption, CCA-secure public-key encryption, etc. Due to the existence of the side-channel attack, the leakage of trapdoor information in lossy trapdoor function systems can lead to the impossibility of provable security. Recently, Zhang et al. introduced a model of consecutive and continual leakage-resilient and updatable lossy trapdoor functions (ULTFs) and provided a concrete construction to achieve the security. Meanwhile, they proposed a consecutive and continual leakage-resilient public-key encryption scheme. However, in this paper, we demonstrate that the correctness of injective function can not be satisfied. Furthermore, the attacker can easily distinguish the evaluation key of ULTFs generated by the challenger according to the security model. Finally, we show two new constructions based on the continual leakage-resilient public-key encryption scheme of Brakerski et al. (FOCS 2010) and demonstrate the security of our scheme in the consecutive and continual leakage model.

Sign in / Sign up

Export Citation Format

Share Document