Results 31 to 40 of about 6,908 (279)
QuantumCommitting to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not changing it.
Lijie Chen, Ramis Movassagh
doaj +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
On Pseudo-Random Oracles [PDF]
Tatra Mountains Mathematical Publications, 2012 ABSTRACT Many cryptographic systems which involve hash functions have proof of their security in a so called random oracle model. Behavior of hash functions used in such cryptographic systems should be as close as possible to the behavior of a random function. There are several properties of hash functions dealing with a random behavior.
openaire +2 more sources
DAGS: Key encapsulation using dyadic GS codes
Journal of Mathematical Cryptology, 2018 Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo +12 more
doaj +1 more source
Random Oracle Reducibility [PDF]
, 2011 We discuss a reduction notion relating the random oracles in two cryptographic schemes A and B. Basically, the random oracle of scheme B reduces to the one of scheme A if any hash function instantiation of the random oracle (possibly still oracle based) which makes A secure also makes B secure. In a sense, instantiating the random oracle in scheme B is
Paul Baecher, Marc Fischlin
openaire +2 more sources
ID-based transitive signature schemes without random oracle
Tongxin xuebao, 2010 Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s ...
MA Xiao-long1 +4 more
doaj +2 more sources
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Advancing Organic Chemistry Using High‐Throughput Experimentation
Angewandte Chemie, EarlyView.This review outlines major advances in the design, execution, analysis, and data management phases of high‐throughput experimentation (HTE). The limitations and potential opportunities of applying modern HTE to organic synthesis are highlighted. Abstract High‐throughput experimentation (HTE), the miniaturization and parallelization of reactions, is a ...
Reem Nsouli +2 more
wiley +2 more sources
On the Oracle Properties of Bayesian Random Forest for Sparse High-Dimensional Gaussian Regression
Mathematics, 2023 Random forest (RF) is a widely used data prediction and variable selection technique. However, the variable selection aspect of RF can become unreliable when there are more irrelevant variables than relevant ones.
Oyebayo Ridwan Olaniran +1 more
doaj +1 more source
On Obfuscation with Random Oracles [PDF]
, 2015 Assuming trapdoor permutations, we show that there exist function families that cannot be VBB-obfuscated even if both the obfuscator and the obfuscated program have access to a random oracle. Specifically, these families are the robust unobfuscatable families of [Bitansky-Paneth, STOC 13].
Yael Tauman Kalai +3 more
openaire +2 more sources