Results 1  10
of
74,174
Verified Indifferentiable Hashing into Elliptic Curves
"... Abstract. Many cryptographic systems based on elliptic curves are proven secure in the Random Oracle Model, assuming there exist probabilistic functions that map elements in some domain (e.g. bitstrings) onto uniformly and independently distributed points in a curve. When implementing such systems, ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
known for some time, the first generic construction for hashing into ordinary elliptic curves indifferentiable from a random oracle was put forward only recently by Brier et al. We present a machinechecked proof of this construction. The proof is based on an extension of the CertiCrypt framework
Indifferentiable Hashing to . . .
"... A number of recent works have considered the problem of constructing constanttime hash functions to various families of elliptic curves over finite fields. In the relevant literature, it has been occasionally asserted that constanttime hashing to certain special elliptic curves, in particular so ..."
Abstract
 Add to MetaCart
A number of recent works have considered the problem of constructing constanttime hash functions to various families of elliptic curves over finite fields. In the relevant literature, it has been occasionally asserted that constanttime hashing to certain special elliptic curves, in particular so
Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
"... At Crypto 2010, Brier et al. proposed the first construction of a hash function into ordinary elliptic curves that was indifferentiable from a random oracle, based on Icart’s deterministic encoding from Crypto 2009. Such a hash function can be plugged into any cryptosystem that requires hashing into ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
At Crypto 2010, Brier et al. proposed the first construction of a hash function into ordinary elliptic curves that was indifferentiable from a random oracle, based on Icart’s deterministic encoding from Crypto 2009. Such a hash function can be plugged into any cryptosystem that requires hashing
An Indifferentiable Hash Function into Elliptic Curves
"... Abstract. We provide the first construction of a hash function into an elliptic curve that is indifferentiable from a random oracle. Our construction can be based on any efficient encoding into an ellipticcurve, for example Icart’s function or the ShallueWoestijneUlas (SWU) algorithm. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We provide the first construction of a hash function into an elliptic curve that is indifferentiable from a random oracle. Our construction can be based on any efficient encoding into an ellipticcurve, for example Icart’s function or the ShallueWoestijneUlas (SWU) algorithm.
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 512 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
Efficient indifferentiable hashing into ordinary elliptic curves
 of Lecture Notes in Computer Science
, 2010
"... Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart’s deterministic encoding from Crypto 2009. While almost as efficient as Icart’s encoding, this hash function can be plugged into any cryptosyste ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart’s deterministic encoding from Crypto 2009. While almost as efficient as Icart’s encoding, this hash function can be plugged into any
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
Short signatures from the Weil pairing
, 2001
"... Abstract. We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signa ..."
Abstract

Cited by 743 (28 self)
 Add to MetaCart
Abstract. We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where
Widearea cooperative storage with CFS
, 2001
"... The Cooperative File System (CFS) is a new peertopeer readonly storage system that provides provable guarantees for the efficiency, robustness, and loadbalance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers pr ..."
Abstract

Cited by 1009 (56 self)
 Add to MetaCart
provide a distributed hash table (DHash) for block storage. CFS clients interpret DHash blocks as a file system. DHash distributes and caches blocks at a fine granularity to achieve load balance, uses replication for robustness, and decreases latency with server selection. DHash finds blocks using
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
’ of holomorphic curves of higher genus curves in Calabi–Yau manifolds. It is shown that topological amplitudes can also be reinterpreted as computing corrections to superpotential terms appearing in the effective 4d theory resulting from compactification of standard 10d superstrings on the corresponding N = 2
Results 1  10
of
74,174