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

Suppose $\ell$ is a prime number, ${\mathbf Q}_\ell$ is the field of $\ell$-adic numbers, ${\mathbf F}_\ell$ is the finite field of $\ell$ elements, and $d$ is a positive integer Suppose $G$ is a finite subgroup of a symplectic group $Sp_{2d}({\mathbf Q}_\ell)$ We prove that $G$ can be embedded in $Sp_{2d}({\mathbf F}_\ell)$ in such a way that the characteristic polynomials are preserved (mod $\ell$), as long as $\ell>3$

Modular representations arising from self-dual $\ell$-adic representations of finite groups

: In order to make computing on encrypted data more practical to use and more secure from attack, it is necessary to discover, develop, and understand the mathematics on which it is based and the mathematics that can be used to attack it. The security of homomorphic encryption schemes is based on the presumed difficulty of mathematics problems about lattices. Discovering and fully exploring algorithms to solve these mathematical problems allow computing on encrypted data to be performed with confidence, knowing that its cryptographic security is based on sound mathematical foundations. Hendrik Lenstra and Alice Silverberg discovered and developed algorithms to solve some lattices problems under suitable conditions, and investigated the mathematical foundations of these algorithms. A primary method of attack on homomorphic encryption schemes consists of lattice algorithms performed on ideal lattices, which are lattices with a certain type of algebraic structure. Any structure or symmetry is potentially susceptible to exploitation and attack. The work performed here gives algorithms for lattice problems for lattices that have symmetry. Recommendations are that the mathematical foundations of lattices with symmetry be further developed, in order to quantify the security of lattice-based cryptography, including especially the security of homomorphic encryption schemes.

https://apps.dtic.mil/dtic/tr/fulltext/u2/a626653.pdf

Using Mathematics to Make Computing on Encrypted Data Secure and Practical

We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.

Determining cyclicity of finite modules

Suppose $F$ is either a global field or a finitely generated extension of ${\mathbf Q}$, $A$ is an abelian variety over $F$, and $\ell$ is a prime not equal to the characteristic of $F$. Let $Z$ denote the center of the endomorphism algebra of $A$. Let $G$ denote the group of ${\mathbf Q}_\ell$-points of the identity connected component of the Zariski closure of the image of the $\ell$-adic representation associated to $A$. We prove the $\ell$-independence of the intersection of $G$ with the torsion subgroup of $Z$. Our results provide evidence in the direction of the Mumford-Tate Conjecture.

Images of $\ell$-adic representations and automorphisms of abelian varieties

In this paper we give conditions under which two abelian varieties that are defined over a finite field $F$, and are isogenous over some larger field, are $F$-isogenous. Further, we give conditions under which a given isogeny is defined over $F$.

Alice Silverberg

Papers

Modular representations arising from self-dual $\ell$-adic representations of finite groups

Using Mathematics to Make Computing on Encrypted Data Secure and Practical

Determining cyclicity of finite modules

Images of $\ell$-adic representations and automorphisms of abelian varieties

Isogenies of abelian varieties over finite fields