Results 31 to 40 of about 105,934 (253)
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
Quantum query complexity of symmetric oracle problems [PDF]
Quantum, 2021 We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, and we find a description of the optimal success probability of a $t$-query ...
Daniel Copeland, Jamie Pommersheim
doaj +1 more source
A Quantum Random Walk Search Algorithm [PDF]
, 2002 Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts.
A. Childs +8 more
core +2 more sources
An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain
IEEE Access, 2018 Identity-based cryptosystems mean that public keys can be directly derived from user identifiers, such as telephone numbers, email addresses, and social insurance number, and so on.
Qun Lin +5 more
doaj +1 more source
Finite mixture regression: A sparse variable selection by model selection for clustering [PDF]
, 2014 We consider a finite mixture of Gaussian regression model for high- dimensional data, where the number of covariates may be much larger than the sample size. We propose to estimate the unknown conditional mixture density by a maximum likelihood estimator,
Devijver, Emilie
core +4 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
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
Oblivious Transfer Based on NTRUEncrypt
IEEE Access, 2018 Oblivious transfer (OT) is the most fundamental process in cryptosystems and serves as the basic building block for implementing protocols, such as the secure multi-party computation and the fair electronic contract.
Bo Mi +4 more
doaj +1 more source
Effects of Noisy Oracle on Search Algorithm Complexity
, 2003 Grover's algorithm provides a quadratic speed-up over classical algorithms for unstructured database or library searches. This paper examines the robustness of Grover's search algorithm to a random phase error in the oracle and analyzes the complexity of
B. Pablo-Norman +13 more
core +1 more source
Customizing Tactile Sensors via Machine Learning‐Driven Inverse Design
Advanced Science, EarlyView.ABSTRACT Replicating the sophisticated sense of touch in artificial systems requires tactile sensors with precisely tailored properties. However, manually navigating the complex microstructure‐property relationship results in inefficient and suboptimal designs.
Baocheng Wang +15 more
wiley +1 more source