Better security for functional encryption for inner product evaluations, Cryptology ePrint Archive, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01380726
Simple functional encryption schemes for inner products, PKC 2015, vol.9020, pp.733-751, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01108287
Efficient public trace and revoke from standard assumptions: Extended abstract, ACM CCS 17, pp.2277-2293, 2017. ,
From selective to adaptive security in functional encryption, CRYPTO 2015, Part II, vol.9216, pp.657-677, 2015. ,
The function field sieve, Algorithmic Number Theory, pp.108-121, 1994. ,
Functional encryption: New perspectives and lower bounds, CRYPTO 2013, Part II, vol.8043, pp.500-518, 2013. ,
Fully secure functional encryption for inner products, from standard assumptions, CRYPTO 2016, Part III, vol.9816, pp.333-362, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01228559
A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications, PKC 2017, Part II, vol.10175, pp.37-54, 2003. ,
Verifiable functional encryption, ASIACRYPT 2016, Part II, vol.10032, pp.557-587 ,
, , 2016.
Security estimates for quadratic field based cryptosystems, ACISP 10, vol.6168, pp.233-247, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00477949
Semantically-secure functional encryption: Possibility results, impossibility results and the quest for a general definition, Bou17. F. Bourse. Functional Encryption for Inner-Product Evaluations, vol.8257, pp.218-234, 2013. ,
Encryption switching protocols revisited: Switching modulo p, CRYPTO 2017, Part I, vol.6597, pp.255-287, 2011. ,
On the security of cryptosystems with quadratic decryption: The nicest cryptanalysis, EUROCRYPT 2009, vol.5479, pp.260-277, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01082343
Linearly homomorphic encryption from DDH, CT-RSA 2015, vol.9048, pp.487-505, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01213284
Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, A course in computational algebraic number theory, vol.1462, pp.45-64, 1998. ,
Practical verifiable encryption and decryption of discrete logarithms, CRYPTO 2003, vol.2729, pp.126-144, 2003. ,
On the achievability of simulation-based security for functional encryption, CRYPTO 2013, Part II, vol.8043, pp.519-535, 2013. ,
Functional encryption without obfuscation, TCC 2016-A, Part II, vol.9563, pp.480-511, 2016. ,
Symmetric subgroup membership problems, PKC 2005, vol.3386, pp.104-119, 2005. ,
How to run turing machines on encrypted data, CRYPTO 2013, Part II, vol.8043, pp.536-553, 2013. ,
Zeldovich. Reusable garbled circuits and succinct functional encryption, 45th ACM STOC, pp.555-564, 2013. ,
Trapdoors for hard lattices and new cryptographic constructions, 40th ACM STOC, pp.197-206, 2008. ,
Functional encryption with bounded collusions via multi-party computation, CRYPTO 2012, vol.7417, pp.627-643, 2012. ,
Computing discrete logarithms in quadratic orders, Journal of Cryptology, vol.13, issue.4, pp.473-492, 2000. ,
Predicate encryption supporting disjunctions, polynomial equations, and inner products, EUROCRYPT 2008, vol.4965, pp.146-162, 2008. ,
A variant of the Cramer-Shoup cryptosystem for groups of unknown order, Mar03. J. Martinet. Perfect Lattices in Euclidean Spaces. Grundlehren der mathematischen Wissenschaften, vol.2501, pp.27-45, 2002. ,
Worst-case to average-case reductions based on Gaussian measures, Number Theory and Applications (Proc. NATO Advanced Study Inst. on Number Theory and Applications, pp.372-381, 1988. ,
Worst-case to average-case reductions based on gaussian measures, SIAM J. Comput, vol.37, issue.1, pp.267-302, 2007. ,
Definitional issues in functional encryption, Cryptology ePrint Archive, 2010. ,
Public-key cryptosystems based on composite degree residuosity classes, EUROCRYPT'99, vol.1592, pp.47-53, 1984. ,
Wat15. B. Waters. A punctured programming approach to adaptively secure functional encryption, CRYPTO 2015, Part II, vol.3494, pp.678-697, 2005. ,
Compute c1 = g r 3. Compute c2 = f m ,
, Pick ? ?, vol.0, p.1
,
, pk, sk) ? KeyGen(1 ? , 1 µ ) 2. m0, m1 ? A(pk)
, Return (? = ? )