[BLR^{+}14] 
Semantically Secure OrderRevealing Encryption: MultiInput Functional Encryption Without Obfuscation
By Dan Boneh, Kevin Lewi, Mariana Raykova, Amit Sahai, Mark Zhandry, and Joe Zimmerman
[PDF]
[ePrint]

[Zha14b] 
Adaptively Secure Broadcast Encryption with Small System Parameters
By Mark Zhandry
[PDF]
[ePrint]
We build the first publickey broadcast encryption system that simultaneously achieves adaptive security against arbitrary number
of colluders, has small system parameters, and has a security proof based on noninteractive falsifiable assumptions. Our scheme is
built from composite order multilinear maps and enjoys a ciphertext overhead, private key size, and public key size that are are all
polylogarithmic in the total number of users. Previous broadcast schemes with similar parameters are either proven secure in a weaker
static model, or rely on powerful tools such as program obfuscation and involve nonfalsifiable assumptions.
@misc{Zha14b, author = {Mark Zhandry}, title = {Adaptively Secure Broadcast Encryption with Small System Parameters}, misc = {Full version available at \url{http://eprint.iacr.org/2014/757}}, year = {2014} }

[GGHZ14b] 
Fully Secure Functional Encryption without Obfuscation
By Sanjam Garg, Craig Gentry, Shai Halevi, and Mark Zhandry
[PDF]
[ePrint]
Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability obfuscation, which in
turn either relies on an exponential number of assumptions (basically, one per circuit), or a polynomial set of assumptions, but
with an exponential loss in the security reduction. Additionally these schemes are proved in an unrealistic selective security
model, where the adversary is forced to specify its target before seeing the public parameters. For these constructions, full
security can be obtained but at the cost of an exponential loss in the security reduction.
In this work, we overcome the above limitations and realize a fully secure functional encryption scheme without using indistinguishability
obfuscation. Specifically the security of our scheme relies only on the polynomial hardness of simple assumptions on multilinear maps.
@misc{GGHZ14b, author = {Sanjam Garg and Craig Gentry and Shai Halevi and Mark Zhandry}, title = {Fully Secure Functional Encryption without Obfuscation}, misc = {Full version available at \url{http://eprint.iacr.org/2014/666}}, year = {2014} }

[BWZ14] 
Low Overhead Broadcast Encryption from Multilinear Maps
By Dan Boneh, Brent Waters, and Mark Zhandry
In CRYPTO 2014
[PDF]
[ePrint]
[slides]
We use multilinear maps to provide a solution to the longstanding problem of publickey broadcast encryption where all
parameters in the system are small. In our constructions, ciphertext overhead, private key size, and public key size are
all polylogarithmic in the total number of users. The systems are fully collusionresistant against any number of colluders.
All our systems are based on an O(log N)way multilinear map to support a broadcast system for N users. We present three
constructions based on different types of multilinear maps and providing different security guarantees. Our systems naturally
give identitybased broadcast systems with short parameters.
@inproceedings{BWZ14, author = {Dan Boneh and Brent Waters and Mark Zhandry}, title = {Low Overhead Broadcast Encryption from Multilinear Maps}, booktitle = {Proceedings of CRYPTO 2014}, misc = {Full version available at \url{http://eprint.iacr.org/2014/195}}, year = {2014} }

[GGHZ14a] 
Fully Secure Attribute Based Encryption from Multilinear Maps
By Sanjam Garg, Craig Gentry, Shai Halevi, and Mark Zhandry
[PDF]
[ePrint]
We construct the first fully secure attribute based encryption (ABE) scheme that can handle access control policies
expressible as polynomialsize circuits. Previous ABE schemes for general circuits were proved secure only in an unrealistic
selective security model, where the adversary is forced to specify its target before seeing the public parameters, and full
security could be obtained only by complexity leveraging, where the reduction succeeds only if correctly guesses the adversary's
target string x^*, incurring a 2^{x^*} loss factor in the tightness of the reduction.
At a very high level, our basic ABE scheme is reminiscent of Yao's garbled circuits, with 4 gadgets per gate of the circuit, but
where the decrypter in our scheme puts together the appropriate subset of gate gadgets like puzzle pieces by using a cryptographic
multilinear map to multiply the pieces together. We use a novel twist of Waters' dual encryption methodology to prove the full
security of our scheme. Most importantly, we show how to preserve the delicate informationtheoretic argument at the heart of Waters'
dual system by enfolding it in an informationtheoretic argument similar to that used in Yao's garbled circuits.
@misc{GGHZ14a, author = {Sanjam Garg and Craig Gentry and Shai Halevi and Mark Zhandry}, title = {Fully Secure Attribute Based Encryption from Multilinear Maps}, misc = {Full version available at \url{http://eprint.iacr.org/2014/622}}, year = {2014} }

[Zha14a] 
How to Avoid Obfuscation Using Witness PRFs
By Mark Zhandry
[PDF]
[ePrint]
Recently, program obfuscation has proven to be an extremely powerful tool and has been used to construct a variety of
cryptographic primitives with amazing properties. However, current candidate obfuscators are far from practical and
rely on unnatural hardness assumptions about multilinear maps. In this work, we bring several applications of obfuscation
closer to practice by showing that a weaker primitive called witness pseudorandom functions (witness PRFs) suffices.
Applications include multiparty key exchange without trusted setup, polynomiallymany hardcore bits for any oneway
function, and more. We then show how to instantiate witness PRFs from multilinear maps. Our witness PRFs are simpler and
more efficient than current obfuscation candidates, and involve very natural hardness assumptions about the underlying maps.
@misc{Zha14a, author = {Mark Zhandry}, title = {How to Avoid Obfuscation Using Witness PRFs}, misc = {Full version available at \url{http://eprint.iacr.org/2014/301}}, year = {2014} }
