Results 51 to 60 of about 5,642 (158)
A Decentralized Signcryption Scheme Based on CFL
SensorsThe rapid advancement of quantum computing technology poses a significant threat to conventional public key cryptographic infrastructure. The SM2 (state key cryptography algorithm no.
Leyi Shi, Mengting Liu
doaj +1 more source
Provably secure private key protection scheme for smart mobile terminal
Tongxin xuebao, 2012 A provable security scheme for private key protection of smart mobile terminal (SMT) was presented.In the scheme a improved security mechanism is incorporated,which includes password protection,key division and partial key retrieval from server of strong
Jun MA, Jian-feng MA, Yuan-bo GUO
doaj +2 more sources
Certificateless Anonymous Authentication Scheme Supporting Illegal Signatures Localization for Internet of Vehicles [PDF]
Jisuanji gongchengIn the Internet of Vehicles (IoV) environment, vehicles are connected to public networks through the Internet and information is vulnerable to various malicious attacks from attackers during transmission.
YANG Xiaodong, LI Muzi, MA Guozu, LI Songyu, WANG Caifen
doaj +1 more source
On the security of the Courtois-Finiasz-Sendrier signature
Open Mathematics, 2018 We prove that a variant of the Courtois-Finiasz-Sendrier signature is strongly existentially unforgeable under chosen message attack in the random oracle model, assuming hardness of the Permuted Goppa Syndrome Decoding Problem (also known as the ...
Morozov Kirill +3 more
doaj +1 more source
Practical Lattice-Based Multisignature Schemes for Blockchains
IEEE Access, 2019 Compact multisignature is vital for shrinking the signature size of decentralized blockchain. All practical compact multisignature schemes have been constructed from the discrete logarithm problem which is potentially vulnerable to quantum computing ...
Changshe Ma, Mei Jiang
doaj +1 more source
A Machine-Checked Formalization of the Random Oracle Model [PDF]
, 2006 Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to abandon the perfect cryptography hypothesis and reason about the computational
Gilles Barthe, Sabrina Tarento
openaire +1 more source
A Secure Authentication Protocol Supporting Efficient Handover for UAV
MathematicsUnmanned Aerial Vehicles (UAVs) are increasingly pivotal in operations such as flood rescue, wildfire surveillance, and covert military endeavors, with their integration into the Internet of Things (IoT) networks broadening the scope of services they ...
Kang Wen +5 more
doaj +1 more source
Pseudorandomness in the (Inverseless) Haar Random Oracle Model
We study the (in)feasibility of quantum pseudorandom notions in a quantum analog of the random oracle model, where all the parties, including the adversary, have oracle access to the same Haar random unitary. In this model, we show the following: - (Unbounded-query secure) pseudorandom unitaries (PRU) exist.
Ananth, Prabhanjan +3 more
openaire +3 more sources
Zero Knowledge in the Random Oracle Model, Revisited [PDF]
, 2009 We revisit previous formulations of zero knowledge in the random oracle model due to Bellare and Rogaway (CCS '93) and Pass (Crypto '03), and present a hierarchy for zero knowledge that includes both of these formulations. The hierarchy relates to the programmability of the random oracle, previously studied by Nielsen (Crypto '02).
openaire +1 more source
Special Soundness in the Random Oracle Model
IACR Communications in CryptologyWe generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis of the extraction error and running time.
openaire +1 more source