S. Agrawal, D. Boneh, and X. Boyen, Efficient Lattice (H)IBE in the Standard Model, Eurocrypt, 2010.
DOI : 10.1007/978-3-642-13190-5_28

M. Ajtai, Generating Hard Instances of the Short Basis Problem, ICALP, pp.1-9, 1999.
DOI : 10.1007/3-540-48523-6_1

J. Alwen, S. Krenn, K. Pietrzak, and D. Wichs, Learning with rounding revisited ? new reduction, properties and applications, 2013.

J. Alwen and C. Peikert, Generating Shorter Bases for Hard Random Lattices, STACS, 2009.
DOI : 10.1137/S0097539795293172
URL : https://hal.archives-ouvertes.fr/inria-00359718

M. H. Au, Q. Wu, W. Susilo, and Y. Mu, Compact E-Cash from Bounded Accumulator, CT-RSA, 2007.
DOI : 10.1007/11967668_12

W. Banaszczyk, New bounds in some transference theorems in the geometry of numbers, Mathematische Annalen, vol.68, issue.1, 1993.
DOI : 10.1007/BF01445125

A. Banerjee and C. Peikert, New and improved key-homomorphic pseudo-random functions, Crypto, 2014.

A. Banerjee, C. Peikert, and A. Rosen, Pseudo-random functions and lattices, Eurocrypt, 2012.

C. Baum, I. Damgård, K. Larsen, and M. Nielsen, How to Prove Knowledge of Small Secrets, 2016.
DOI : 10.1007/978-3-642-00457-5_22

M. Belenkiy, M. Chase, M. Kohlweiss, and A. Lysyanskaya, Compact E-Cash and Simulatable VRFs Revisited, Pairing, 2009.
DOI : 10.1007/11745853_34

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, 1993.
DOI : 10.1145/168588.168596

E. Ben-sasson, A. Chiesa, C. Garman, M. Green, I. Miers et al., Zerocash: Decentralized anonymous payments from bitcoin, IEEE S&P, 2014.

F. Benhamouda, J. Camenisch, S. Krenn, V. Lyubashevsky, and G. Neven, Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures, Asiacrypt, 2014.
DOI : 10.1007/978-3-662-45611-8_29
URL : https://hal.archives-ouvertes.fr/hal-01084737

F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Pietrzak, Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings, ESORICS, 2015.
DOI : 10.1007/978-3-319-02937-5_4
URL : https://hal.archives-ouvertes.fr/hal-01214722

A. Bogdanov, S. Guo, D. Masny, S. Richelson, and A. Rosen, On the hardness of leanring with rounding over small modulus, TCC 2016

F. Böhl, D. Hofheinz, T. Jager, J. Koch, and C. Striecks, Confined Guessing: New Signatures From Standard Assumptions, Journal of Cryptology, vol.28, issue.1, p.2015
DOI : 10.1017/CBO9780511814549

D. Boneh, K. Lewi, H. Montgomery, and A. Raghunathan, Key Homomorphic PRFs and Their Applications, Crypto, 2013.
DOI : 10.1007/978-3-642-40041-4_23

X. Boyen, Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More, PKC 2010, 2010.
DOI : 10.1007/978-3-642-13013-7_29

Z. Brakerski and Y. T. Kalai, A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model, IACR Cryptology ePrint Archive, p.86, 2010.

Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, 2013.
DOI : 10.1145/2488608.2488680
URL : https://hal.archives-ouvertes.fr/hal-00922194

E. Brickell, D. Pointcheval, S. Vaudenay, and M. Yung, Design Validations for Discrete Logarithm Based Signature Schemes, PKC, 2000.
DOI : 10.1007/978-3-540-46588-1_19

J. Camenisch, S. Hohenberger, M. Kohlweiss, A. Lysyanskaya, and M. Meyerovich, How to win the clone wars: Efficient periodic n-times anonymous authentication, ACM-CCS, 2006.

J. Camenisch, S. Hohenberger, and A. Lysyanskaya, Compact E-Cash, Eurocrypt, 2005.
DOI : 10.1007/11426639_18

J. Camenisch, S. Hohenberger, and A. Lysyanskaya, Balancing accountability and privacy using e-cash, SCN, 2005.

J. Camenisch and A. Lehmann, (Un)linkable Pseudonyms for Governmental Databases, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS '15, 2015.
DOI : 10.1007/3-540-68339-9_33

J. Camenisch and A. Lysyanskaya, A Signature Scheme with Efficient Protocols, SCN, 2002.
DOI : 10.1007/3-540-36413-7_20

J. Camenisch and A. Lysyanskaya, Signature Schemes and Anonymous Credentials from Bilinear Maps, Crypto, 2004.
DOI : 10.1007/978-3-540-28628-8_4

J. Camenisch, A. Lysyanskaya, and M. Meyerovich, Endorsed E-Cash, 2007 IEEE Symposium on Security and Privacy (SP '07), 2007.
DOI : 10.1109/SP.2007.15

S. Canard and A. Gouget, Divisible E-Cash Systems Can Be Truly Anonymous, Eurocrypt, 2007.
DOI : 10.1007/978-3-540-72540-4_28

S. Canard, D. Pointcheval, O. Sanders, and J. Traoré, Divisible e-cash made practical, PKC, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01134006

S. Canard, D. Pointcheval, O. Sanders, and J. Traoré, Scalable Divisible E-cash, ACNS, 2015.
DOI : 10.1007/978-3-319-28166-7_14
URL : https://hal.archives-ouvertes.fr/hal-01139400

D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai trees, or how to delegate a lattice basis, Eurocrypt, 2010.

M. Chase, C. Ganesh, and P. Mohassel, Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials, 2016.
DOI : 10.1007/978-3-662-46803-6_8

D. Chaum, Blind Signatures for Untraceable Payments, Crypto, 1982.
DOI : 10.1007/978-1-4757-0602-4_18

D. Chaum, Blind Signature System, Crypto, 1983.
DOI : 10.1007/978-1-4684-4730-9_14

D. Chaum, Security without identification: transaction systems to make big brother obsolete, Communications of the ACM, vol.28, issue.10, 1985.
DOI : 10.1145/4372.4373

D. Chaum, On-line cash checks, Eurocrypt, 1989.

D. Chaum, A. Fiat, and M. Naor, Untraceable Electronic Cash, Crypto, 1988.
DOI : 10.1007/0-387-34799-2_25

D. Chaum and T. Pedersen, Transferred Cash Grows in Size, Eurocrypt, 1992.
DOI : 10.1007/3-540-47555-9_32

A. Chiesa, M. Green, J. Liu, P. Miao, I. Miers et al., Decentralized Anonymous Micropayments, Eurocrypt, 2017.
DOI : 10.1109/SFCS.1977.24

S. Coull, M. Green, and S. Hohenberger, Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials, PKC, 2009.
DOI : 10.1007/11426639_7

R. Cramer and I. Damgård, On the amortized complexity of zero-knowledge protocols, Crypto, 2009.

R. Cramer, I. Damgård, C. Xing, and C. Yuan, Amortized complexity of zeroknowledge proofs revisited: Achieving linear soundness slack, Eurocrypt, 2017.

I. Damgård, Efficient Concurrent Zero-Knowledge in the Auxiliary String Model, Eurocrypt, 2000.
DOI : 10.1007/3-540-45539-6_30

R. Pino and V. Lyubashevsky, Amortization with fewer equations for proving knowledge of small secrets. Cryptology ePrint Archive, 2017.

Y. Dodis and A. Yampolskiy, A Verifiable Random Function with Short Proofs and Keys, PKC, 2005.
DOI : 10.1007/978-3-540-30580-4_28

N. Döttling and D. Schröder, Efficient Pseudorandom Functions via On-the-Fly Adaptation, Crypto, 2015.
DOI : 10.1007/978-3-662-47989-6_16

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Crypto, 1987.
DOI : 10.1007/3-540-47721-7_12

M. Franklin and M. Yung, Secure and efficient off-line digital money, ICALP, 1993.

T. Frederiksen, J. Nielsen, and C. Orlandi, Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge, Eurocrypt, 2015.
DOI : 10.1007/978-3-662-46803-6_7

M. Freedman, Y. Ishai, B. Pinkas, and O. Reingold, Keyword Search and Oblivious Pseudorandom Functions, TCC, 2005.
DOI : 10.1007/978-3-540-30576-7_17

E. Fujisaki and K. Suzuki, Traceable ring signature, PKC, 2007.

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, 2009.
DOI : 10.1145/1536414.1536440

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, 2008.
DOI : 10.1145/1374376.1374407

I. Giacomelli, J. Madsen, and C. Orlandi, Zkboo: Faster zero-knowledge for boolean circuits, USENIX Security Symposium, 2016.

O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, Journal of the ACM, vol.33, issue.4, 1986.
DOI : 10.1145/6490.6503

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, STOC, 1985.

S. D. Gordon, J. Katz, and V. Vaikuntanathan, A Group Signature Scheme from Lattice Assumptions, Asiacrypt, 2010.
DOI : 10.1007/978-3-642-17373-8_23

M. Green and I. Miers, Bolt: Anonymous payment channels for decentralized currencies. Cryptology ePrint Archive, 2016.

J. Groth and A. Sahai, Efficient Non-interactive Proof Systems for Bilinear Groups, Eurocrypt, 2008.
DOI : 10.1007/978-3-540-78967-3_24

S. Hohenberger, S. Myers, and R. , Pass, and a. shelat. ANONIZE: A large-scale anonymous survey system, IEEE S&P 2014, 2014.

S. Hohenberger and B. Waters, Short and Stateless Signatures from the RSA Assumption, Crypto, 2009.
DOI : 10.1007/978-3-642-03356-8_38

Y. Ishai, E. Kushilevitz, R. Ostrovksy, and A. Sahai, Zero-knowledge from secure multiparty computation, STOC, 2007.

S. Jarecki, A. Kiayias, and H. Krawczyk, Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model, Asiacrypt, 2014.
DOI : 10.1007/978-3-662-45608-8_13

S. Jarecki and X. Liu, Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection, TCC, 2009.
DOI : 10.1007/3-540-46766-1_9

M. Jawurek, F. Kerschbaum, and C. Orlandi, Zero-knowledge using garbled circuits, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, 2013.
DOI : 10.1145/2508859.2516662

A. Kawachi, K. Tanaka, and K. Xagawa, Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems, Asiacrypt, 2008.
DOI : 10.1007/978-3-540-30144-8_28

F. Laguillaumie, A. Langlois, B. Libert, and D. Stehlé, Lattice-Based Group Signatures with Logarithmic Signature Size, Asiacrypt, 2013.
DOI : 10.1007/978-3-642-42045-0_3
URL : https://hal.archives-ouvertes.fr/hal-00920420

A. Langlois, S. Ling, K. Nguyen, and H. Wang, Lattice-Based Group Signature Scheme with Verifier-Local Revocation, 2014.
DOI : 10.1007/978-3-642-54631-0_20
URL : https://hal.archives-ouvertes.fr/hal-00983084

B. Libert, S. Ling, F. Mouhartem, K. Nguyen, and H. Wang, 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

B. Libert, S. Ling, F. Mouhartem, K. Nguyen, and H. Wang, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, Asiacrypt, 2016.
DOI : 10.1007/978-3-319-02937-5_4
URL : https://hal.archives-ouvertes.fr/hal-01267123

B. Libert, S. Ling, K. Nguyen, and H. Wang, Zero-knowledge arguments for latticebased accumulators: Logarithmic-size ring signatures and group signatures without trapdoors, Eurocrypt, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01314642

S. Ling, K. Nguyen, D. Stehlé, and H. Wang, 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

S. Ling, K. Nguyen, and H. Wang, Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based, PKC, 2015.
DOI : 10.1007/978-3-662-46447-2_19

H. Lipmaa, N. Asokan, and V. Niemi, Secure Vickrey Auctions without Threshold Trust, Financial Cryptography, 2002.
DOI : 10.1007/3-540-36504-4_7

V. Lyubashevsky, Lattice-Based Identification Schemes Secure Under Active Attacks, PKC, 2008.
DOI : 10.1007/978-3-540-78440-1_10

S. Micali, M. Rabin, and S. Vadhan, Verifiable random functions, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999.
DOI : 10.1109/SFFCS.1999.814584

S. Micali and R. Sidney, A simple method for generating and sharing pseudo-random functions, Crypto, 1995.

D. Micciancio and C. Peikert, Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller, Eurocrypt, 2012.
DOI : 10.1007/978-3-642-29011-4_41

D. Micciancio and S. Vadhan, Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More, Crypto, 2003.
DOI : 10.1007/978-3-540-45146-4_17

I. Miers, C. Garman, M. Green, and A. Rubin, Zerocoin: Anonymous Distributed E-Cash from Bitcoin, 2013 IEEE Symposium on Security and Privacy, 2013.
DOI : 10.1109/SP.2013.34

S. Nakamoto, Bitcoin: A peer-to-peer electronic cash system

M. Naor, B. Pinkas, and O. Reingold, Distributed Pseudo-random Functions and KDCs, Eurocrypt, 1999.
DOI : 10.1007/3-540-48910-X_23

P. Nguyen, J. Zhang, and Z. Zhang, Simpler Efficient Group Signatures from Lattices, PKC, 2015.
DOI : 10.1007/978-3-662-46447-2_18
URL : https://hal.archives-ouvertes.fr/hal-01256013