Results 41 to 50 of about 95,474 (182)
Sparsity oracle inequalities for the Lasso
This paper studies oracle properties of $\ell_1$-penalized least squares in nonparametric regression setting with random design. We show that the penalized least squares estimator satisfies sparsity oracle inequalities, i.e., bounds in terms of the ...
Bunea, Florentina +2 more
core +1 more source
Security of signed ELGamal encryption [PDF]
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against the adaptive chosen ciphertext attack, in which an attacker can freely use
Jakobsson, Markus, Schnorr, Claus Peter
core
Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes [PDF]
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
Non Observability in the Random Oracle Model [PDF]
Security proofs in the Random Oracle Model (ROM) often make use of the fact that the queries made by the adversary to the oracle are observable as well as the responses to those queries can be programmed. While, the issue of programmability of query responses has received attention in the literature, to the best of our knowledge, observability of the ...
Prabhanjan Ananth, Raghav Bhaskar
openaire +1 more source
Tail index estimation, concentration and adaptivity [PDF]
This paper presents an adaptive version of the Hill estimator based on Lespki's model selection method. This simple data-driven index selection method is shown to satisfy an oracle inequality and is checked to achieve the lower bound recently derived by ...
Boucheron, Stéphane, Thomas, Maud
core +3 more sources
Sharp template estimation in a shifted curves model [PDF]
This paper considers the problem of adaptive estimation of a template in a randomly shifted curve model. Using the Fourier transform of the data, we show that this problem can be transformed into a stochastic linear inverse problem.
Bigot, Jérémie +2 more
core +8 more sources
Quantum Security of a Compact Multi-Signature
With the rapid advances in quantum computing, quantum security is now an indispensable property for any cryptographic system. In this paper, we study how to prove the security of a complex cryptographic system in the quantum random oracle model. We first
Shaoquan Jiang
doaj +1 more source
Formal Indistinguishability Extended to the Random Oracle Model [PDF]
Several generic constructions for transforming one-way func-tions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of their arguments. That is, given the image by a one-way function of a random value, an adversary has only negligible probability to compute this random value. Encryp-tion schemes must
Ene, Cristian +2 more
openaire +3 more sources
Two improved content extraction signature schemes
Motivated by the idea of batch signatures,two variants of content extraction signature schemes based on commit vector and RSA respectively were presented.In the proposed schemes,the efficiency of signing and verification were improved by unifying certain
Min WANG +3 more
doaj +3 more sources
RKA Security for Identity-Based Signature Scheme
Related-key attack (RKA) is a kind of side-channel attack considered for kinds of cryptographic primitives, such as public key encryption, digital signature, pseudorandom functions etc.
Jinyong Chang +4 more
doaj +1 more source

