Results 21 to 30 of about 95,474 (182)
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
Provably Secure Covert Communication on Blockchain
Cryptography, 2018 Blockchain is a public open ledger that provides data integrity in a distributed manner. It is the underlying technology of cryptocurrencies and an increasing number of related applications, such as smart contracts. The open nature of blockchain together
Juha Partala
doaj +1 more source
Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model [PDF]
, 2015 Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature ...
Eaton, Edward, Song, Fang
core +3 more sources
Blockchain Certificateless Encryption Mechanism Based on National Secret Algorithm [PDF]
Jisuanji kexueThe blockchain has attracted widespread attention because of its distributed,non-tamperable and inherent immutability features.However,the international cryptographic algorithm used in the blockchain has certain backdoor security risks.Based on the ...
XIANG Yanjie, HUANG Xiaofang, XIANG Kefeng, ZHENG Ji’nan
doaj +1 more source
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [PDF]
QuantumCopy-protection allows a software distributor to encode a program in such a way that it can be evaluated on any input, yet it cannot be "pirated" – a notion that is impossible to achieve in a classical setting.
Andrea Coladangelo +2 more
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
Slope heuristics and V-Fold model selection in heteroscedastic regression using strongly localized bases [PDF]
, 2016 We investigate the optimality for model selection of the so-called slope heuristics, $V$-fold cross-validation and $V$-fold penalization in a heteroscedastic with random design regression context.
Navarro, Fabien, Saumard, Adrien
core +4 more sources
Weakened Random Oracle Models with Target Prefix [PDF]
, 2019 Weakened random oracle models (WROMs) are variants of the random oracle model (ROM). The WROMs have the random oracle and the additional oracle which breaks some property of a hash function. Analyzing the security of cryptographic schemes in WROMs, we can specify the property of a hash function on which the security of cryptographic schemes depends ...
Tezuka, Masayuki +2 more
openaire +2 more sources
Discrete choice, permutations, and reconstruction [PDF]
, 2018 In this paper we study the well-known family of Random Utility Models, developed over 50 years ago to codify rational user behavior in choosing one item from a finite set of options. In this setting each user draws i.i.d. from some distribution a utility
Chierichetti, Flavio +2 more
core +1 more source
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