scholarly journals Fundamental problems in provable security and cryptography

2006 ◽  
Vol 364 (1849) ◽  
pp. 3215-3230 ◽  
Author(s):  
Alexander W Dent
Keyword(s):  
Provable Security ◽  
Random Oracle Model ◽  
Random Oracle ◽  
New Approach ◽  
Active Research

This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research and dozens of significant results, there are fundamental problems which have yet to be solved. We also present a new approach to one of the more controversial aspects of provable security, the random oracle model.

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 Provable Security of The Generalized ElGamal Signature Scheme

2019 ◽  
Vol 11 (6) ◽  
pp. 77 ◽  
Author(s):  
Demba Sow ◽  
Mamadou Ghouraissiou Camara
Keyword(s):  
Provable Security ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Security Proof ◽  
New Variant ◽  
Elgamal Signature

A new variant of the ElGamal signature scheme called "a Generalized ElGamal signature scheme" is proposed in 2011. The Generalized ElGamal signature scheme is a modified ElGamal signature scheme. In this paper, we propose the security proof of the Generalized ElGamal signature scheme in the random oracle model. First, we recall some security notions of signature schemes and show the security of the modified ElGamal Signature scheme.

scholarly journals The discovery of biological subphenotypes in ARDS: a novel approach to targeted medicine?

2021 ◽  
Vol 9 (1) ◽  
Author(s):  
Karin Wildi ◽  
Samantha Livingstone ◽  
Chiara Palmieri ◽  
Gianluigi LiBassi ◽  
Jacky Suen ◽  
...  
Keyword(s):  
Age Groups ◽  
Geographical Location ◽  
High Morbidity ◽  
Shock State ◽  
Pharmacological Agents ◽  
New Approach ◽  
Novel Approach ◽  
Active Research ◽  
Targeted Medicine ◽  
Core Features

AbstractThe acute respiratory distress syndrome (ARDS) is a severe lung disorder with a high morbidity and mortality which affects all age groups. Despite active research with intense, ongoing attempts in developing pharmacological agents to treat ARDS, its mortality rate remains unaltered high and treatment is still only supportive. Over the years, there have been many attempts to identify meaningful subgroups likely to react differently to treatment among the heterogenous ARDS population, most of them unsuccessful. Only recently, analysis of large ARDS cohorts from randomized controlled trials have identified the presence of distinct biological subphenotypes among ARDS patients: a hypoinflammatory (or uninflamed; named P1) and a hyperinflammatory (or reactive; named P2) subphenotype have been proposed and corroborated with existing retrospective data. The hyperinflammatory subphenotyope was clearly associated with shock state, metabolic acidosis, and worse clinical outcomes. Core features of the respective subphenotypes were identified consistently in all assessed cohorts, independently of the studied population, the geographical location, the study design, or the analysis method. Additionally and clinically even more relevant treatment efficacies, as assessed retrospectively, appeared to be highly dependent on the respective subphenotype. This discovery launches a promising new approach to targeted medicine in ARDS. Even though it is now widely accepted that each ARDS subphenotype has distinct functional, biological, and mechanistic differences, there are crucial gaps in our knowledge, hindering the translation to bedside application. First of all, the underlying driving biological factors are still largely unknown, and secondly, there is currently no option for fast and easy identification of ARDS subphenotypes. This narrative review aims to summarize the evidence in biological subphenotyping in ARDS and tries to point out the current issues that will need addressing before translation of biological subohenotypes into clinical practice will be possible.

scholarly journals An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Quanrun Li ◽  
Chingfang Hsu ◽  
Debiao He ◽  
Kim-Kwang Raymond Choo ◽  
Peng Gong
Keyword(s):  
Quantum Computer ◽  
Rapid Development ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Mean Value ◽  
Blind Signature ◽  
Signature Scheme ◽  
Practical Applications ◽  
Universal Quantum ◽  
Identity Based

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

scholarly journals ID-based key-insulated signcryption with equality test in cloud computing

2021 ◽  
Vol 3 (4) ◽  
Author(s):  
Seth Alornyo ◽  
Kingsford Kissi Mireku ◽  
Mustapha Adamu Mohammed ◽  
Daniel Adu-Gyamfi ◽  
Michael Asante
Keyword(s):  
Cloud Computing ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Harsh Environments ◽  
Secret Key ◽  
Secret Keys ◽  
Security Property ◽  
Equality Test ◽  
Chosen Ciphertext Attack ◽  
Chosen Message Attack

AbstractKey-insulated encryption reduces the problem of secret key exposure in hostile setting while signcryption cryptosystem attains the benefits of digitally signing a ciphertext and public key cryptosystem. In this study, we merge the primitives of parallel key-insulation cryptosystem and signcryption with equality test to construct ID-based parallel key-insulated signcryption with a test for equality (ID-PKSET) in cloud computing. The construction prevent data forgery, data re-play attacks and reduces the leakage of secret keys in harsh environments. Our scheme attains the security property of existential unforgeable chosen message attack (EUF-CMA) and indistinquishable identity chosen ciphertext attack (IND-ID-CCA2) using random oracle model.

Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Shuichi Katsumata ◽  
Shota Yamada ◽  
Takashi Yamakawa
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Security Proofs
Sign in / Sign up

Export Citation Format

Share Document