There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

As more sensitive data is shared and stored by third-party sites on the Internet, there will be a need to encrypt data stored at these sites. One drawback of encrypting data, is that it can be selectively shared only at a coarse-grained level (i.e., giving another party your private key). We develop a new cryptosystem for fine-grained sharing of encrypted data that we call Key-Policy Attribute-Based Encryption (KP-ABE). In our cryptosystem, ciphertexts are labeled with sets of attributes and private keys are associated with access structures that control which ciphertexts a user is able to decrypt. We demonstrate the applicability of our construction to sharing of audit-log information and broadcast encryption. Our construction supports delegation of private keys which subsumesHierarchical Identity-Based Encryption (HIBE).

/pdf/attribute-based-encryption-for-fine-grained-access-control-3fjqefx4um.pdf

Attribute-based encryption for fine-grained access control of encrypted data

We introduce a short signature scheme based on the Computational Diffie-Hellman 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 signatures are typed in by a human or signatures are sent over a low-bandwidth channel.

/pdf/short-signatures-from-the-weil-pairing-5ajupg0cpi.pdf

Short Signatures from the Weil Pairing

After two decades of research and development, elliptic curve cryptography now has widespread exposure and acceptance. Industry, banking, and government standards are in place to facilitate extensive deployment of this efficient public-key mechanism. Anchored by a comprehensive treatment of the practical aspects of elliptic curve cryptography (ECC), this guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key encryption, digital signatures, and key establishment. In addition, the book addresses some issues that arise in software and hardware implementation, as well as side-channel attacks and countermeasures. Readers receive the theoretical fundamentals as an underpinning for a wealth of practical and accessible knowledge about efficient application. Features & Benefits: * Breadth of coverage and unified, integrated approach to elliptic curve cryptosystems * Describes important industry and government protocols, such as the FIPS 186-2 standard from the U.S. National Institute for Standards and Technology * Provides full exposition on techniques for efficiently implementing finite-field and elliptic curve arithmetic* Distills complex mathematics and algorithms for easy understanding* Includes useful literature references, a list of algorithms, and appendices on sample parameters, ECC standards, and software toolsThis comprehensive, highly focused reference is a useful and indispensable resource for practitioners, professionals, or researchers in computer science, computer engineering, network design, and network data security.

https://cdn.preterhuman.net/texts/cryptography/Hankerson,%20Menezes,%20Vanstone.%20Guide%20to%20elliptic%20curve%20cryptography%20(Springer,%202004)(ISBN%20038795273X)(332s)_CsCr_.pdf

Guide to Elliptic Curve Cryptography

We present the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles We first present our IBE construction and reduce the security of our scheme to the decisional Bilinear Diffie-Hellman (BDH) problem Additionally, we show that our techniques can be used to build a new signature scheme that is secure under the computational Diffie-Hellman assumption without random oracles

/pdf/efficient-identity-based-encryption-without-random-oracles-54xabxckwn.pdf

Efficient identity-based encryption without random oracles

We show that if a rational map is constant on each isomorphism class of unpolarized abelian varieties of a given dimension, then it is a constant map. Our results are motivated by and shed light on a proposed construction of a cryptographic protocol for multiparty non-interactive key exchange.

Algebraic maps constant on isomorphism classes of unpolarized abelian varieties are constant

Suppose $A$ is an abelian variety over a field $F$, and $\ell$ is a prime not equal to the characteristic of $F$. Let $F_{\Phi,\ell}(A)$ denote the smallest extension of $F$ such that the Zariski closure of the image of the $\ell$-adic representation associated to $A$ is connected. Serre introduced this field, and proved that when $F$ is a finitely generated extension of ${\mathbf Q}$, $F_{\Phi,\ell}(A)$ does not depend on the choice of $\ell$. In this paper we study extensions $F_{\Phi,\ell}(B)/F$ for twists $B$ of a given abelian variety, especially when the abelian varieties are of Weil type.

Connectedness extensions for abelian varieties

In this paper we study the \'etale cohomology groups associated to abelian varieties. We obtain necessary and sufficient conditions for an abelian variety to have semistable reduction (or purely additive reduction which becomes semistable over a quadratic extension) in terms of the action of the absolute inertia group on the \'etale cohomology groups with finite coefficients.

Étale cohomology and reduction of abelian varieties

We put the Gentry-Szydlo algorithm into a mathematical framework, and show that it is part of a general theory of “lattices with symmetry”. For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial time algorithm to accomplish this, based on the work of Gentry and Szydlo. The techniques involve algorithmic algebraic number theory, analytic number theory, commutative algebra, and lattice basis reduction. This sheds new light on the Gentry-Szydlo algorithm, and the ideas should be applicable to a range of questions in cryptography.

/pdf/revisiting-the-gentry-szydlo-algorithm-2pd6kplwqc.pdf

Revisiting the Gentry-Szydlo Algorithm.

We show that if a rational map is constant on each isomorphism class of unpolarized abelian varieties of a given dimension, then it is a constant map. Our results shed light on a question raised by Boneh et al. (J. Math. Cryptol. 14:1 (2020), 5–14) concerning a proposal for multiparty noninteractive key exchange.

https://msp.org/ant/2021/15-3/ant-v15-n3-p06-s.pdf

Alice Silverberg

Papers

Algebraic maps constant on isomorphism classes of unpolarized abelian varieties are constant

Connectedness extensions for abelian varieties

Étale cohomology and reduction of abelian varieties

Revisiting the Gentry-Szydlo Algorithm.

Algebraic maps constant on isomorphism classes of unpolarized abelian varieties are constant