scholarly journals Provably Secure Security-Enhanced Timed-Release Encryption in the Random Oracle Model

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Ke Yuan ◽  
Yahui Wang ◽  
Yingming Zeng ◽  
Wenlei Ouyang ◽  
Zheng Li ◽  
...  
Keyword(s):  
Computational Cost ◽  
Random Oracle Model ◽  
Fixed Time ◽  
Random Oracle ◽  
Storage Space ◽  
Private Key ◽  
Cryptographic Primitive ◽  
The Social ◽  
Definition Of ◽  
Provably Secure

Cryptographic primitive of timed-release encryption (TRE) enables the sender to encrypt a message which only allows the designated receiver to decrypt after a designated time. Combined with other encryption technologies, TRE technology is applied to a variety of scenarios, including regularly posting on the social network and online sealed bidding. Nowadays, in order to control the decryption time while maintaining anonymity of user identities, most TRE solutions adopt a noninteractive time server mode to periodically broadcast time trapdoors, but because these time trapdoors are generated with fixed time server’s private key, many “ciphertexts” related to the time server’s private key that can be cryptanalyzed are generated, which poses a big challenge to the confidentiality of the time server’s private key. To work this out, we propose a concrete scheme and a generic scheme of security-enhanced TRE (SETRE) in the random oracle model. In our SETRE schemes, we use fixed and variable random numbers together as the time server’s private key to generate the time trapdoors. We formalize the definition of SETRE and give a provably secure concrete construction of SETRE. According to our experiment, the concrete scheme we proposed reduces the computational cost by about 10.8% compared to the most efficient solution in the random oracle model but only increases the almost negligible storage space. Meanwhile, it realizes one-time pad for the time trapdoor. To a large extent, this increases the security of the time server’s private key. Therefore, our work enhances the security and efficiency of the TRE.

scholarly journals An Efficient and Provably-Secure Certificateless Proxy-Signcryption Scheme for Electronic Prescription System

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Li Li ◽  
Siqin Zhou ◽  
Kim-Kwang Raymond Choo ◽  
Xiaohong Li ◽  
Debiao He
Keyword(s):  
Random Oracle Model ◽  
Research Area ◽  
Random Oracle ◽  
Performance Evaluations ◽  
Electronic Prescription ◽  
Limited Bandwidth ◽  
Cryptographic Primitive ◽  
And Performance ◽  
Signcryption Scheme ◽  
Provably Secure

Electronic prescription is increasingly popular in our society, particularly in technologically advanced countries. Due to strict legal requirements and privacy regulations, authorization and data confidentiality are two important features in electronic prescription system. By combining signature and encryption functions, signcryption is an efficient cryptographic primitive that can be used to provide these two features. While signcryption is a fairly established research area, most signcryption schemes proposed recently have several limitations (e.g., high communication costs, limited bandwidth, and insecurity), and designing secure and practical signcryption schemes remains challenging. In this paper, we propose an improved certificateless proxy signcryption (CLPSC) scheme, based on elliptic curve cryptography (ECC). We also demonstrate that the proposed CLPSC scheme is secure in the random oracle model and evaluate its performance with related schemes. The security and performance evaluations show that the proposed CLPSC scheme can potentially be implemented on resource-constrained low-computing mobile devices in an electronic prescription system.

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.

Short Online/Off-line Signature Scheme for Wireless Sensor Networks

2015 ◽  
Vol 9 (1) ◽  
pp. 47-61
Author(s):  
Anser Ghazzaal Ali Alquraishee ◽  
Jayaprakash Kar ◽  
Naomie Salim
Keyword(s):  
Computational Cost ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Signature Scheme ◽  
Diffie Hellman ◽  
Two Phases ◽  
Chosen Message Attack

This article proposes a novel construction of short Online/Off-line signature scheme with provable security in the random oracle model for wireless sensor network (WSN). Security of the proposed scheme relies on k-CAA Problem as well as Computational Diffie-Hellman problem and is resistant against chosen message attack. The scheme is suited for broadcast authentication and integrity of message exchanging between the sensor nodes. The process of generation of the signature is carried out in two phases online and off-line. The heavy computation is performed in off-line phase, i.e the base station. The actual signature will be generated in the sensor nodes. The authors assume that the online phase is more efficient. Here they have evaluated the size of the signature with respect to the size of the user's public key and compare with some current schemes. Also, the authors have evaluated the computational cost and time which shows the scheme is most suited to implement on sensor node.

Certificate-Based Generalized Ring Signcryption Scheme

2018 ◽  
Vol 29 (06) ◽  
pp. 1063-1088 ◽  
Author(s):  
Caixue Zhou ◽  
Guangyong Gao ◽  
Zongmin Cui ◽  
Zhiqiang Zhao
Keyword(s):  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Formal Definition ◽  
Security Model ◽  
Storage Space ◽  
Ring Signature ◽  
Highly Efficient ◽  
Signcryption Scheme

Generalized ring signcryption (GRSC) can realize ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system with a large number of users, or whose function may be changed, or with limited storage space. We give a formal definition and security model of GRSC in the certificate-based cryptosystem setting and propose a concrete scheme by using bilinear pairings. The confidentiality of our scheme can be proved under the GBDH and CDH assumptions and the unforgeability of our scheme can be proved under [Formula: see text] and CDH assumptions in the random oracle model, and what is more, our scheme has unconditional anonymity. Compared with other certificateless ring signcryption schemes that use bilinear pairings, it is a highly efficient one.

scholarly journals Scalable Revocable Identity-Based Signature Scheme with Signing Key Exposure Resistance from Lattices

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Congge Xie ◽  
Jian Weng ◽  
Jinming Wen
Keyword(s):  
Quantum Computing ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Signature Scheme ◽  
Integer Solutions ◽  
Identity Based ◽  
Definition Of ◽  
Lattice Based Cryptography ◽  
Key Exposure

In 2014, a new security definition of a revocable identity-based signature (RIBS) with signing key exposure resistance was introduced. Based on this new definition, many scalable RIBS schemes with signing key exposure resistance were proposed. However, the security of these schemes is based on traditional complexity assumption, which is not secure against attacks in the quantum era. Lattice-based cryptography has many attractive features, and it is believed to be secure against quantum computing attacks. We reviewed existing lattice-based RIBS schemes and found that all these schemes are vulnerable to signing key exposure. Hence, in this paper, we propose the first lattice-based RIBS scheme with signing key exposure resistance by using the left-right lattices and delegation technology. In addition, we employ a complete subtree revocation method to ensure our construction meeting scalability. Finally, we prove that our RIBS scheme is selective-ID existentially unforgeable against chosen message attacks (EUF-sID-CMA) under the standard short integer solutions (SIS) assumption in the random oracle model.

Another Attack on Tso's Short Signature Scheme Based on Bilinear Pairings

2011 ◽  
Vol 63-64 ◽  
pp. 785-788
Author(s):  
Fan Yu Kong ◽  
Lei Wu ◽  
Jia Yu
Keyword(s):  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Public Key ◽  
Signature Scheme ◽  
Short Signature ◽  
Provably Secure

In 2009, R. Tso et al. proposed an efficient pairing-based short signature scheme which is provably secure in the Random Oracle Model. In this paper, we propose a new key substitution attack on Raylin Tso et al.’s short signature scheme. For a given message and the corresponding valid signature, the malicious attacker can generate a substituted public key. Everyone verifies the signature successfully with the malicious attacker’s substituted public key. Therefore, Raylin Tso et al.’s short signature scheme has a security flaw in the multi-user setting.

Efficient Convertible User Designating Confirmer Partially Blind Signature with Provable Security

2011 ◽  
Vol 282-283 ◽  
pp. 307-311
Author(s):  
Li Zhen Ma
Keyword(s):  
Provable Security ◽  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Schemes ◽  
Partially Blind Signature ◽  
Provably Secure

Any one who knows the signer’s public key can verify the validity of a given signature in partially blind signature schemes. This verifying universality may be used by cheats if the signed message is sensitive or personal. To solve this problem, a new convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm the validity of given signatures and convert given signatures into publicly verifiable ones, is proposed. Compared with Huang et al.’s scheme, the signature size is shortened about 25% and the computation quantity is reduced about 36% in the proposed scheme. Under random oracle model and intractability of Discrete Logarithm Problem the proposed scheme is provably secure.

scholarly journals A Blockchain-Based Hierarchical Authentication Scheme for Multiserver Architecture

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Miqi Wu ◽  
Lin You ◽  
Gengran Hu ◽  
Liang Li ◽  
Chengtang Cao
Keyword(s):  
Secure Communication ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Authentication Scheme ◽  
Security Risks ◽  
Private Key ◽  
Blockchain Technology ◽  
Man In The Middle ◽  
User Revocation ◽  
Authentication Schemes

In a multiserver architecture, authentication schemes play an important role in the secure communication of the system. In many multiserver authentication schemes, the security of the mutual authentications among the participants is based on the security of the registration center’s private key. This centralized architecture can create security risks due to the leakage of the registration center’s private key. Blockchain technology, with its decentralized, tamper-proof, and distributed features, can provide a new solution for multiserver authentication schemes. In a lot of multiserver authentication schemes, users’ permission is generally controlled by the registration center (RC), but these permission control methods cannot be applied in the decentralized blockchain system. In this paper, a blockchain-based authentication scheme for multiserver architecture is proposed. Our scheme provides a hierarchical authentication method to solve the problems of user permission control and user revocation caused by no registration center. The security of our scheme is formally proved under the random oracle model. According to our analysis, our scheme is resistant to attacks such as impersonation attacks and man-in-the-middle attacks. In addition, our performance analysis shows that the proposed scheme has less computation overhead.

scholarly journals Provably Secure Lattice-Based Self-Certified Signature Scheme

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Qiang Yang ◽  
Daofeng Li
Keyword(s):  
Computational Cost ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Communication Overhead ◽  
Small Integer ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Public ◽  
Security Technologies

Digital signatures are crucial network security technologies. However, in traditional public key signature schemes, the certificate management is complicated and the schemes are vulnerable to public key replacement attacks. In order to solve the problems, in this paper, we propose a self-certified signature scheme over lattice. Using the self-certified public key, our scheme allows a user to certify the public key without an extra certificate. It can reduce the communication overhead and computational cost of the signature scheme. Moreover, the lattice helps prevent quantum computing attacks. Then, based on the small integer solution problem, our scheme is provable secure in the random oracle model. Furthermore, compared with the previous self-certified signature schemes, our scheme is more secure.

scholarly journals Extracting Witnesses from Proofs of Knowledge in the Random Oracle Model

2001 ◽  
Vol 8 (52) ◽  
Author(s):  
Jens Groth
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Proof System ◽  
Interactive Proof ◽  
Proof Of Knowledge ◽  
Proofs Of Knowledge ◽  
Voting Scheme ◽  
Definition Of ◽  
Interactive Proof System ◽  
Threshold Encryption

We prove that a 3-move interactive proof system with the special soundness property made non-interactive by applying the Fiat-Shamir heuristic is almost a non-interactive proof of knowledge in the random oracle model. In an application of the result we demonstrate that the Damgård-Jurik voting scheme based on homomorphic threshold encryption is secure against a nonadaptive adversary according to Canetti's definition of multi-party computation security.

Sign in / Sign up

Export Citation Format

Share Document