Universally composable adaptive oblivious transfer (with access control) from standard assumptions, Proceedings of the 2013 ACM workshop on Digital identity management, DIM '13, 2013. ,
DOI : 10.1145/2517881.2517883
Priced Oblivious Transfer: How to Sell Digital Goods, 2001. ,
DOI : 10.1007/3-540-44987-6_8
Generating Shorter Bases for Hard Random Lattices, Theory of Computing Systems, vol.26, issue.5, 2009. ,
DOI : 10.1137/S0097539795293172
URL : https://hal.archives-ouvertes.fr/inria-00359718
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE, 2012. ,
DOI : 10.1007/978-3-642-29011-4_29
Bounded-width polynomial-size branching programs recognize exactly those languages in nc1, STOC'86, 1986. ,
Confined Guessing: New Signatures From Standard Assumptions, Journal of Cryptology, vol.28, issue.1, pp.176-208, 2015. ,
DOI : 10.1017/CBO9780511814549
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles, 2004. ,
DOI : 10.1007/978-3-540-24676-3_14
FHE Circuit Privacy Almost for Free, 2016. ,
DOI : 10.1007/978-3-642-13190-5_2
URL : https://hal.archives-ouvertes.fr/hal-01360110
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More, 2010. ,
DOI : 10.1007/978-3-642-13013-7_29
Design Validations for Discrete Logarithm Based Signature Schemes, 2000. ,
DOI : 10.1007/978-3-540-46588-1_19
Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption, 2012. ,
DOI : 10.1007/978-3-642-32928-9_31
Oblivious transfer with access control, Proceedings of the 16th ACM conference on Computer and communications security, CCS '09, 2009. ,
DOI : 10.1145/1653662.1653679
Oblivious Transfer with Hidden Access Control Policies, 2011. ,
DOI : 10.1007/978-3-642-19379-8_12
Neven, and a. shelat. Simulatable adaptive oblivious transfer, 2007. ,
Universally composable security: a new paradigm for cryptographic protocols, Proceedings 2001 IEEE International Conference on Cluster Computing, 2001. ,
DOI : 10.1109/SFCS.2001.959888
Bonsai trees, or how to delegate a lattice basis, 2010. ,
Private information retrieval, FOCS, 1995. ,
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials, 2009. ,
DOI : 10.1007/11426639_7
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption, 2003. ,
DOI : 10.1007/978-3-540-45146-4_15
Conditional oblivious transfer and timed-release encryption, Eurocrypt'99, 1999. ,
Two-Message, Oblivious Evaluation of Cryptographic Functionalities, 2016. ,
DOI : 10.1109/SFCS.1979.26
Sanitization of FHE Ciphertexts, 2016. ,
DOI : 10.1007/978-3-662-49890-3_12
URL : https://hal.archives-ouvertes.fr/hal-01394216
A randomized protocol for signing contracts, Communications of the ACM, vol.28, issue.6, pp.637-647, 1985. ,
DOI : 10.1145/3812.3818
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, 1987. ,
DOI : 10.1007/3-540-47721-7_12
Keyword Search and Oblivious Pseudorandom Functions, 2005. ,
DOI : 10.1007/978-3-540-30576-7_17
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based, 2013. ,
DOI : 10.1007/978-3-642-40041-4_5
How to play any mental game or a completeness theorem for protocols with honest majority, STOC, 1987. ,
Riding on Asymmetry: Efficient ABE for Branching Programs, 2015. ,
DOI : 10.1007/978-3-662-48797-6_23
A Group Signature Scheme from Lattice Assumptions, 2010. ,
DOI : 10.1007/978-3-642-17373-8_23
Blind Identity-Based Encryption and Simulatable Oblivious Transfer, 2007. ,
DOI : 10.1007/978-3-540-76900-2_16
Universally Composable Adaptive Oblivious Transfer, Asiacrypt, vol.20, issue.2-3, 2008. ,
DOI : 10.1109/SFCS.1986.25
Practical Adaptive Oblivious Transfer from Simple Assumptions, 2011. ,
DOI : 10.1007/978-3-642-19571-6_21
Restricted adaptive oblivious transfer, Theoretical Computer Science, vol.412, issue.46, pp.6498-6506, 2011. ,
DOI : 10.1016/j.tcs.2011.06.023
Packing messages and optimizing bootstrapping in GSW-FHE, 2015. ,
Short and stateless signatures from the RSA assumption. Crypto, 2009. ,
Evaluating Branching Programs on Encrypted Data, TCC, 2007. ,
DOI : 10.1007/978-3-540-70936-7_31
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection, 2009. ,
DOI : 10.1007/3-540-46766-1_9
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems, 2008. ,
DOI : 10.1007/978-3-540-30144-8_28
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption, 2010. ,
DOI : 10.1007/978-3-642-15317-4_12
Generic fully simulatable adaptive oblivious transfer, 2011. ,
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, 2016. ,
DOI : 10.1007/978-3-319-02937-5_4
URL : https://hal.archives-ouvertes.fr/hal-01267123
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption, 2016. ,
DOI : 10.1007/978-3-319-02937-5_4
URL : https://hal.archives-ouvertes.fr/hal-01394087
Zero-knowledge arguments for latticebased accumulators: Logarithmic-size ring signatures and group signatures without trapdoors, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01314642
Efficient fully-simulatable oblivious transfer. CT-RSA, 2008. ,
Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications, 2013. ,
DOI : 10.1007/978-3-642-36362-7_8
URL : https://hal.archives-ouvertes.fr/hal-00767548
Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based, 2015. ,
DOI : 10.1007/978-3-662-46447-2_19
Private branching programs: On communication-efficient cryptocomputing, IACR Cryptology ePrint Archive, p.107, 2008. ,
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller, 2012. ,
DOI : 10.1007/978-3-642-29011-4_41
Oblivious transfer with adaptive queries. Crypto, 1999. ,
Efficient oblivious transfer protocols. SODA, 2001. ,
Computationally Secure Oblivious Transfer, Journal of Cryptology, vol.18, issue.1, pp.1-35, 2005. ,
DOI : 10.1007/s00145-004-0102-6
Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures, ACNS'08, 2008. ,
DOI : 10.1007/978-3-540-68914-0_7
A Framework for Efficient and Composable Oblivious Transfer, 2008. ,
DOI : 10.1007/978-3-540-85174-5_31
How to exchange secrets by oblivious transfer, 1981. ,
On lattices, learning with errors, random linear codes, and cryptography, 2005. ,
Fuzzy Identity-Based Encryption, 2005. ,
DOI : 10.1007/11426639_27
A new paradigm for public key identification, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1757-1768, 1996. ,
DOI : 10.1109/18.556672
Smooth projective hashing and two-message oblivious transfer, 2005. ,
Oblivious Transfer with Access Control : Realizing Disjunction without Duplication, 2010. ,
DOI : 10.1007/978-3-642-17455-1_7