A language-dependent cryptographic primitive

1997 ◽  
Vol 10 (1) ◽  
pp. 37-49 ◽  
Author(s):  
Toshiya Itoh ◽  
Yuji Ohta ◽  
Hiroki Shizuya
Keyword(s):  
Cryptographic Primitive

Publicly auditable conditional blind signatures

2021 ◽  
Vol 29 (2) ◽  
pp. 229-271
Author(s):  
Panagiotis Grontas ◽  
Aris Pagourtzis ◽  
Alexandros Zacharakis ◽  
Bingsheng Zhang
Keyword(s):  
Proof Of Concept ◽  
Equivalence Test ◽  
Zero Knowledge ◽  
Private Key ◽  
Blind Signatures ◽  
Cryptographic Primitive ◽  
Security Properties ◽  
Designated Verifier

This work formalizes Publicly Auditable Conditional Blind Signatures (PACBS), a new cryptographic primitive that allows the verifiable issuance of blind signatures, the validity of which is contingent upon a predicate and decided by a designated verifier. In particular, when a user requests the signing of a message, blinded to protect her privacy, the signer embeds data in the signature that makes it valid if and only if a condition holds. A verifier, identified by a private key, can check the signature and learn the value of the predicate. Auditability mechanisms in the form of non-interactive zero-knowledge proofs are provided, so that a cheating signer cannot issue arbitrary signatures and a cheating verifier cannot ignore the embedded condition. The security properties of this new primitive are defined using cryptographic games. A proof-of-concept construction, based on the Okamoto–Schnorr blind signatures infused with a plaintext equivalence test is presented and its security is analyzed.

scholarly journals Multiparty weighted threshold quantum secret sharing based on the Chinese remainder theorem to share quantum information

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yao-Hsin Chou ◽  
Guo-Jyun Zeng ◽  
Xing-Yu Chen ◽  
Shu-Yu Kuo
Keyword(s):  
Quantum Information ◽  
Phase Shift ◽  
Quantum State ◽  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Security Analysis ◽  
Quantum Secret Sharing ◽  
Security Protocol ◽  
Multiple Quantum ◽  
Cryptographic Primitive

AbstractSecret sharing is a widely-used security protocol and cryptographic primitive in which all people cooperate to restore encrypted information. The characteristics of a quantum field guarantee the security of information; therefore, many researchers are interested in quantum cryptography and quantum secret sharing (QSS) is an important research topic. However, most traditional QSS methods are complex and difficult to implement. In addition, most traditional QSS schemes share classical information, not quantum information which makes them inefficient to transfer and share information. In a weighted threshold QSS method, each participant has each own weight, but assigning weights usually costs multiple quantum states. Quantum state consumption will therefore increase with the weight. It is inefficient and difficult, and therefore not able to successfully build a suitable agreement. The proposed method is the first attempt to build multiparty weighted threshold QSS method using single quantum particles combine with the Chinese remainder theorem (CRT) and phase shift operation. The proposed scheme allows each participant has its own weight and the dealer can encode a quantum state with the phase shift operation. The dividing and recovery characteristics of CRT offer a simple approach to distribute partial keys. The reversibility of phase shift operation can encode and decode the secret. The proposed weighted threshold QSS scheme presents the security analysis of external attacks and internal attacks. Furthermore, the efficiency analysis shows that our method is more efficient, flexible, and simpler to implement than traditional methods.

scholarly journals A Provably Secure ID-Based Signcryption Protocol for Secure and Authentic Energy Efficient Communication

2021 ◽  
Author(s):  
Sunil Kumar ◽  
Pratik Gupta ◽  
Dharminder Dharminder
Keyword(s):  
Computational Cost ◽  
Single Step ◽  
Step Method ◽  
Performance Review ◽  
Diffie Hellman ◽  
Cryptographic Primitive ◽  
Energy Efficient Communication ◽  
Efficient Communication ◽  
Identity Based ◽  
Provably Secure

Abstract Singcryption was first proposed by Yuliang Zheng [1] in 1997, based on the construction of a shortened ElGamal-based signature scheme in parallel to authenticated encryption in a symmetric environment. Signcryption is a cryptographic primitive that enables the conventional two-step method of secure and authenticated message transmission or storage (sign-then-encrypt or encrypt-then-sign) to be done in a single step at a much lower computational cost than the traditional two-step approach. This article concentrates on designing a provably secure identity-based signcryption (IBSC) scheme. The user performs pairing-free computation during encryption in the proposed scheme, making it user-side effective. In addition, the IBSC structure is shown to be secure when dealing with modified bilinear Diffie-Hellman inversion (MBDHI) and modified bilinear strong Diffie-Hellman (MBSDH) problems. The proposed framework supports efficient communication, protection against chosen cipher attack, and existential unforgeability against chosen message attack, according to the performance review of IBSC with related schemes.

On Algebraic Immunity of Weight Symmetric H Boolean Functions

2014 ◽  
Vol 643 ◽  
pp. 124-129
Author(s):  
Jing Lian Huang ◽  
Zhuo Wang ◽  
Juan Li
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Theoretical Basis ◽  
Research Method ◽  
Algebraic Immunity ◽  
Correlation Immunity ◽  
Cryptographic Property ◽  
Cryptographic Primitive ◽  
New Research ◽  
The Relationship

Using the derivative of Boolean functions and the e-derivative defined by ourselves as research tools, we discuss the relationship among a variety of cryptographic properties of the weight symmetric H Boolean functions in the range of the weight with the existence of H Boolean functions. We also study algebraic immunity and correlation immunity of the weight symmetric H Boolean functions and the balanced H Boolean functions. We obtain that the weight symmetric H Boolean function should have the same algebraic immunity, correlation immunity, propagation degree and nonlinearity. Besides, we determine that there exist several kinds of H Boolean functions with resilient, algebraic immunity and optimal algebraic immunity. The above results not only provide a theoretical basis for reducing nearly half of workload when studying the cryptographic properties of H Boolean function, but also provide a new research method for the study of secure cryptographic property of Boolean functions. Such researches are important in cryptographic primitive designs.

FROM CRYPTOGRAPHIC PRIMITIVE TO PROFESSIONAL COMPETENCE

2021 ◽  
Author(s):  
М.В. МИТРОФАНОВ ◽  
Д.Ю. ВАСЮКОВ ◽  
В.В. АНИСИМОВ ◽  
С.И. КУЗНЕЦОВ
Keyword(s):  
Information Security ◽  
Professional Competence ◽  
Local Area Networks ◽  
Educational Practice ◽  
Local Area ◽  
Advanced Training ◽  
Training Course ◽  
Cryptographic Primitive ◽  
Training Specialists

Рассматривается реализованный в учебной практике подход к методике обучения специалистов по защите информации в локально-вычислительных сетях, позволяющий в условиях ограниченного ресурса учебного времени, выделяемого в рамках курса повышения квалификации специалистов, сформировать необходимую профессиональную компетенцию. The article considers the approach to the methodology of training specialists in information security in local area networks, implemented in educational practice, which allows, in the conditions of a limited educational time allocated within the framework of the advanced training course for specialists, to form the necessary professional competence.

FROM CRYPTOGRAPHIC PRIMITIVE TO PROFESSIONAL COMPETENCE

2021 ◽  
Author(s):  
М.В. МИТРОФАНОВ ◽  
Д.Ю. ВАСЮКОВ ◽  
В.В. АНИСИМОВ ◽  
С.И. КУЗНЕЦОВ
Keyword(s):  
Information Security ◽  
Professional Competence ◽  
Local Area Networks ◽  
Educational Practice ◽  
Local Area ◽  
Advanced Training ◽  
Training Course ◽  
Cryptographic Primitive ◽  
Training Specialists

Рассматривается реализованный в учебной практике подход к методике обучения специалистов по защите информации в локально-вычислительных сетях, позволяющий в условиях ограниченного ресурса учебного времени, выделяемого в рамках курса повышения квалификации специалистов, сформировать необходимую профессиональную компетенцию. The article considers the approach to the methodology of training specialists in information security in local area networks, implemented in educational practice, which allows, in the conditions of a limited educational time allocated within the framework of the advanced training course for specialists, to form the necessary professional competence.

Long distance two-party quantum crypto made simple

2012 ◽  
Vol 12 (5&6) ◽  
pp. 448-460
Author(s):  
Iordanis Kerenidis ◽  
Stephanie Wehner
Keyword(s):  
Quantum Communication ◽  
Oblivious Transfer ◽  
Difficult Problem ◽  
Entanglement Swapping ◽  
Quantum States ◽  
Large Network ◽  
Long Distance ◽  
Computational Problem ◽  
Cryptographic Primitive

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long distances remains a difficult problem. Here, we consider a large network of nodes with only neighboring quantum links. We exploit properties of this cloud of nodes to enable any two nodes to achieve security even if they are not directly connected. Our results are based on techniques from classical cryptography and do not resort to technologically difficult procedures like entanglement swapping. More precisely, we show that oblivious transfer can be achieved in such a network if and only if there exists a path in the network between the sender and the receiver along which all nodes are honest. Finally, we show that useful notions of security can still be achieved when we relax the assumption of an honest path. For example, we show that we can combine our protocol for oblivious transfer with computational assumptions such that we obtain security if either there exists an honest path, or, as a backup, at least the adversary cannot solve a computational problem.

Sign in / Sign up

Export Citation Format

Share Document