Results 41 to 50 of about 9,626 (278)
Modeling Random Oracles Under Unpredictable Queries [PDF]
, 2016 In recent work, Bellare, Hoang, and Keelveedhi (CRYPTO 2013) introduced a new abstraction called Universal Computational Extractors (UCEs), and showed how they can replace random oracles (ROs) across a wide range of cryptosystems. We formulate a new framework, called Interactive Computational Extractors (ICEs), that extends UCEs by viewing them as ...
Pooya Farshim, Arno Mittelbach
openaire +3 more sources
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
A New Certificateless Aggregate Signature Scheme [PDF]
Jisuanji gongcheng, 2017 On the basis of the certificateless short signature,this paper proposes a certificateless aggregate signature scheme in resource constrained environment.A signature protocol is initiated by the specified aggregator.The state information including random ...
CAO Suzhen,DAI Wenjie,SUN Han,WANG Xiuya
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
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
Security of discrete log cryptosystems in the random oracle and the generic model [PDF]
, 1999 We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core
Organic Materials of Tomorrow: Horizons of Artificial Intelligence
Advanced Materials, EarlyView.This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena +3 more
wiley +1 more source
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
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
Streebog as a Random Oracle [PDF]
, 2023 The random oracle model is an instrument used for proving that protocol has no structural flaws when settling with standard hash properties is impossible or fairly difficult. In practice, however, random oracles have to be instantiated with some specific
Alexandra Babueva +2 more
core