Results 51 to 60 of about 90,649 (207)
Leveled Certificateless Fully Homomorphic Encryption Schemes From Learning With Errors
IEEE Access, 2020 Fully homomorphic encryption (FHE) is a form of public-key encryption that allows the computation of arbitrary functions on encrypted data without decrypting the data. As a result, it is a useful tool with numerous applications.
Mingxiang Li
doaj +1 more source
Non Observability in the Random Oracle Model [PDF]
, 2013 Security proofs in the Random Oracle Model (ROM) often make use of the fact that the queries made by the adversary to the oracle are observable as well as the responses to those queries can be programmed. While, the issue of programmability of query responses has received attention in the literature, to the best of our knowledge, observability of the ...
Raghav Bhaskar, Prabhanjan Ananth
openaire +2 more sources
Attacks on One Designated Verifier Proxy Signature Scheme
Journal of Applied Mathematics, 2012 In a designated verifier proxy signature scheme, there are three participants, namely, the original signer, the proxy signer, and the designated verifier.
Baoyuan Kang
doaj +1 more source
A Secure User Authentication Protocol for Heterogeneous Mobile Environments
IEEE Access, 2022 Mobile devices have become very important for our daily needs. The user authentication protocols with the key agreement are required to deal with the security issues that arise from the use of mobile devices through Internet applications.
Alzubair Hassan +7 more
doaj +1 more source
The Random Oracle Model and the Ideal Cipher Model Are Equivalent [PDF]
, 2008 The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al.showed that security in the random oracle model implies security in the ideal cipher model; namely they showed that a random oracle can be replaced by a block cipher-based ...
Yannick Seurin +2 more
openaire +2 more sources
Oracle inequalities for weighted group lasso in high-dimensional misspecified Cox models
Journal of Inequalities and Applications, 2020 We study the nonasymptotic properties of a general norm penalized estimator, which include Lasso, weighted Lasso, and group Lasso as special cases, for sparse high-dimensional misspecified Cox models with time-dependent covariates.
Yijun Xiao +3 more
doaj +1 more source
Quantum-secure message authentication via blind-unforgeability [PDF]
, 2020 Formulating and designing unforgeable authentication of classical messages in the presence of quantum adversaries has been a challenge, as the familiar classical notions of unforgeability do not directly translate into meaningful notions in the quantum ...
CH Bennett +17 more
core +3 more sources
Certificateless signature scheme without random oracles
Tongxin xuebao, 2015 The security of certificateless signature schemes can be proved under the random oracle model.However，any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure ...
Yan-qiong LI, Ji-guo LI, Yi-chen ZHANG
doaj +2 more sources
A Private Quantum Bit String Commitment
Entropy, 2020 We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of preserving the privacy of the committed message.
Mariana Gama, Paulo Mateus, André Souto
doaj +1 more source
Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security [PDF]
, 2009 Recently, a variant of proxy re-encryption, named conditional proxy re-encryption (C-PRE), has been introduced. Compared with traditional proxy re-encryption, C-PRE enables the delegator to implement fine-grained delegation of decryption rights, and thus
B. Libert +15 more
core +5 more sources