Results 41 to 50 of about 4,491,165 (327)
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
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
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
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
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model [PDF]
, 2004 Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key.
A. Fiat +25 more
core +6 more sources
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
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
Special Soundness in the Random Oracle Model
IACR Cryptology ePrint ArchiveWe generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis ...
Douglas Wikström
semanticscholar +1 more source
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
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