Results 31 to 40 of about 94,999 (279)
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
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
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
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
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
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
Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes [PDF]
, 2012 International audienceIn this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and ...
B. Biswas +20 more
core +3 more sources
An Identity-Based Group Signature with Membership Revocation in the Standard Model [PDF]
, 2010 Group signatures allow group members to sign an arbitrary number\ud of messages on behalf of the group without revealing their\ud identity. Under certain circumstances the group manager holding a\ud tracing key can reveal the identity of the signer from ...
Hartel, Pieter +3 more
core +12 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