Results 41 to 50 of about 5,642 (158)

Security analysis and improvement of a certificateless signcryption scheme

Tongxin xuebao, 2015
To solve the certificate management problem in the traditional public key cryptography and the key escrow problem in the identity-based public key cryptography, Al-Riyami and Paterson proposed the concept of the certificateless public key cryptography ...
Zhen-guo ZHAO
doaj   +2 more sources

Permutation-Based Hash Chains with Application to Password Hashing

IACR Transactions on Symmetric Cryptology
Hash chain based password systems are a useful way to guarantee authentication with one-time passwords. The core idea dates back to Lamport, and is specified in RFC 1760 as S/Key. At CCS 2017, Kogan et al.
Charlotte Lefevre, Bart Mennink
doaj   +1 more source

Short Signatures in the Random Oracle Model [PDF]

, 2002
We study how digital signature schemes can generate signatures as short as possible, in particular in the case where partial message recovery is allowed. We give a concrete proposition named OPSSR that achieves the lower bound for message expansion, and give an exact security proof of the scheme in the ideal cipher model.
openaire   +1 more source

Pseudorandom Unitaries in the Haar Random Oracle Model

66 ...
Ananth, Prabhanjan, Bostanci, John, Gulati, Aditya, Lin, Yao-Ting   +3 more
openaire   +2 more sources

Provably secure and efficient certificateless sequential multi-signature scheme in random oracle model

Tongxin xuebao, 2014
Certificate less sequential multi-signature scheme could resolve the problem of authentication of recommendation information transmitted through trust train.Qin yan-lin，et al proposed an efficient certificateless sequential multi-signature scheme，and ...
Yan XU, Liu-sheng HUANG, Miao-miao TIAN, Hong ZHONG   +3 more
doaj   +2 more sources

Double-sided: tight proofs for guessing games in the quantum random oracle model

Cybersecurity
The semi-classical One-Way to Hiding (SC-O2H) lemma given by Ambainis et al. (CRYPTO 2019) is a crucial technique to solve the reprogramming problem in the quantum random oracle model (QROM), which can lead to quadratically better bounds for many cases ...
Jiawei Bao, Jiangxia Ge, Rui Xue
doaj   +1 more source

Multi-User Security Bound for Mixed Filter Permutators in the Random Oracle Model

IACR Transactions on Symmetric Cryptology
At Eurocrypt’16, Méaux et al. designed a construction for symmetric ciphers that can be efficiently evaluated with Fully Homomorphic Encryption, dubbed Filter Permutator. They also specify FLIP, a family of Filter Permutators.
Benoît Cogliati, Simon Demarty
doaj   +1 more source

Simulation-Based Secure Functional Encryption in the Random Oracle Model [PDF]

, 2015
One of the main lines of research in functional encryption FE has consisted in studying the security notions for FE and their achievability. This study was initiated by [Boneh et al. --- TCC'11, O'Neilli¾?--- ePrint'10] where it was first shown that for FE the indistinguishability-based IND security notion is not sufficient in the sense that there are ...
Iovino V., Zebroski K.
openaire   +2 more sources

Certificateless

Journal of King Saud University: Computer and Information Sciences, 2014
The concept of aggregate signcryption was first introduced in 2009 by Selvi et al. [Identity based aggregate signcryption schemes, Lecture Notes in Computer Science 5922 LNCS, 2009, pp. 378–397].
Ziba Eslami, Nasrollah Pakniat
doaj   +1 more source

Secure identity-based encryption in the quantum random oracle model [PDF]

International Journal of Quantum Information, 2012
We give the first proof of security for an identity-based encryption (IBE) scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that does not rely on the assumed existence of so-called quantum-secure pseudorandom functions (PRFs). Our techniques are quite general and we use them to obtain security
openaire   +2 more sources