R. Cramer, I. Damgård, and P. Mackenzie, EEcient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions, PKC, p.67, 2000.

J. Camenisch, M. Dubovitskaya, and G. Neven, Oblivious transfer with access control, Citations: § xxii, p.187, 2009.

J. Camenisch, M. Dubovitskaya, G. Neven, and G. Zaverucha, Oblivious transfer with hidden access control policies, Citations: § xxii, vol.6571, p.187, 2011.

R. Canetti and M. Fischlin, Universally composable commitments, Crypto, p.20, 2001.

D. Chaum, A. Fiat, and M. Naor, Untraceable electronic cash, Crypto, vol.403, p.190, 1988.

R. Canetti, O. Goldreich, and S. Halevi, The random oracle methodology, revisited, STOC, vol.45, p.16, 1998.

S. Coull, M. Green, and S. Hohenberger, Controlling access to an oblivious database using stateful anonymous credentials, PKC, number 5443 in LNCS, p.147, 2009.

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private information retrieval, FOCS, p.146, 1995.

D. Chaum, Blind signatures for untraceable payments, Citations: § xvi, vol.2, p.190, 1982.

D. Chaum, Blind signature system, In Crypto, p.190, 1983.

D. Chaum, Security without Identiication: Transactions System to Make Big Brother Obsolete, Citations: § xvi, vol.28, p.51, 1985.

J. H. Cheon, Security analysis of the strong diie-hellman problem, Eurocrypt, vol.4004, p.22, 2006.

R. Canetti, S. Halevi, and J. Katz, Chosen-Ciphertext Security from Identity-Based Encryption, Eurocrypt, vol.77, p.192, 2004.

D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai trees, or how to delegate a lattice basis, Citations: § xix, vol.6110, p.80, 2010.

J. Camenisch, S. Hohenberger, and A. Lysyanskaya, Balancing Accountability and Privacy Using E-Cash, SCN, number 4116 in LNCS, p.53, 2005.

J. Camenisch, S. Hohenberger, and A. Lysyanskaya, Compact e-cash, Eurocrypt, number 3494 in LNCS, vol.27, p.190, 2005.

J. H. Cheon, K. Han, C. Lee, H. Ryu, and D. Stehlé, Cryptanalysis of the Multilinear Map over the Integers, Eurocrypt, 2015. Citations: § xvii and
URL : https://hal.archives-ouvertes.fr/hal-01240445

R. Canetti, E. Kushilevitz, and Y. Lindell, On the limitations of universally composable two-party computation without set-up assumptions, Journal of Cryptology, vol.19, issue.2, p.11, 2006.

J. Camenisch, S. Krenn, A. Lehmann, G. Mikkelsen, G. Neven et al., Formal treatment of privacy-enhancing credential systems, SAC, vol.87, p.90, 2015.

J. Camenisch and A. Lysyanskaya, An eecient system for non-transferable anonymous credentials with optional anonymity revocation, Eurocrypt, number 2045 in LNCS, vol.2, p.51, 2001.

P. Q. Nguyen, J. Zhang, and Z. Zhang, Simpler eecient group signatures from lattices, Citations: § 77, vol.9020, p.118, 2015.

T. Okamoto, An eecient divisible electronic cash scheme, Crypto, vol.963, p.190, 1995.

T. Okamoto, EEcient Blind and Partially Blind Signatures Without Random Oracles, TCC, p.51, 2006.

K. Ohta and T. Okamoto, Universal electronic cash, Crypto, vol.576, p.190, 1991.

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT 1999, number 1592 in LNCS, p.118, 1999.

T. P. Pedersen, Non-Interactive and Information-Theoretic Secure Veriiable Secret Sharing, Crypto, p.34, 1991.

C. Peikert, Public-key cryptosystems from the worst-case shortest vector problem, STOC, p.25, 2009.

T. Prest, Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence, In Asiacrypt, vol.18, p.90, 2017.

D. Pointcheval and J. Stern, Security Proofs for Signature Schemes, Eurocrypt, p.31, 1996.

D. Pointcheval and J. Stern, Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, vol.13, issue.3, p.71, 2000.

D. Poincheval and O. Sanders, Short Randomizable Signatures, CT-RSA, p.75, 2016.

D. Pointcheval and O. Sanders, Reassessing Security of Randomizable Signatures, CT-RSA, p.51, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01903717

C. Papamanthou, E. Shi, R. Tamassia, and K. Yi, Streaming authenticated data structures, Eurocrypt, vol.7881, p.80, 2013.

C. Peikert and V. Vaikuntanathan, Non-interactive statistical zero-knowledge proofs for lattice problems, Citations: § 118, vol.5157, p.190, 2008.

C. Peikert, V. Vaikuntanathan, and B. Waters, A framework for eecient and composable oblivious transfer, Citations: § 146, vol.5157, p.190, 2008.

C. Peikert and B. Waters, Lossy Trapdoor Functions and Their Applications, STOC, p.192, 2008.

M. O. Rabin, Degree of diiculty of computing a function and a partial ordering of recursive sets, p.12, 1960.

M. Rabin, How to exchange secrets by oblivious transfer, Citations: § xvi, p.145, 1981.

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, ACM, 2005. Citations: § xviii, vol.4, p.181

R. D. Rothblum, A. Sealfon, and K. Sotiraki, Towards Non-Interactive ZeroKnowledge for NP from LWE, 2018.

.. .. Lwe,

. , Abstract description of a ?-protocol

. , Security experiments for commitment schemes

. , The Schnorr ?-protocol for discrete logarithm

-. .. Ring,

.. .. Notations-for-stern-like-protocols,

. , Stern-like ZKAoK for the relation R abstract

, Relations between the protagonists in a dynamic group signature scheme, p.45

. .. , Experiment for security against misidentiication attacks, p.48

. , Experiment for security against framing attacks

. , Security experiments for

, Security experiment for the pseudo-random-ciphertext property for an IBE. . 124 List of Tables

. .. , Comparison between diierent group signature schemes, p.74

, Experimental results for the Pairing-Base group signature scheme, p.75

, Comparison between recent lattice-based group signatures, p.78

, Basic notations and extending/permuting techniques used in our protocols, p.170

, Comparison of the diierent adaptive OT protocols secure in the standard model 186

. , Comparison of the diierent adaptive OT-AC schemes secure in the standard model