User menu

Removing the Strong RSA Assumption from Arguments over the Integers

Bibliographic reference Couteau, Geoffroy ; Peters, Thomas ; Pointcheval, David. Removing the Strong RSA Assumption from Arguments over the Integers.36th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2017) (Paris (France), du 30/04/2017 au 04/05/2017). In: Jean Sébastien Coron, Jesper Buus Nielsen, Proceedings of EUROCRYPT 2017, Springer2017, p. 321-350
Permanent URL
  1. Adleman Leonard, Manders Kenneth, Diophantine complexity, 10.1109/sfcs.1976.13
  2. Adelsbach André, Rohe Markus, Sadeghi Ahmad-Reza, Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme, Communications and Multimedia Security (2005) ISBN:9783540287919 p.129-139, 10.1007/11552055_13
  3. Barić Niko, Pfitzmann Birgit, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, Advances in Cryptology — EUROCRYPT ’97 (1997) ISBN:9783540629757 p.480-494, 10.1007/3-540-69053-0_33
  4. Bayer Stephanie, Groth Jens, Efficient Zero-Knowledge Argument for Correctness of a Shuffle, Advances in Cryptology – EUROCRYPT 2012 (2012) ISBN:9783642290107 p.263-280, 10.1007/978-3-642-29011-4_17
  5. Bellare Mihir, Garay Juan A., Rabin Tal, Batch verification with applications to cryptography and checking, LATIN'98: Theoretical Informatics (1998) ISBN:9783540642756 p.170-191, 10.1007/bfb0054320
  6. Bellare Mihir, Garay Juan A., Rabin Tal, Fast batch verification for modular exponentiation and digital signatures, Lecture Notes in Computer Science (1998) ISBN:9783540645184 p.236-250, 10.1007/bfb0054130
  7. Böhl Florian, Hofheinz Dennis, Jager Tibor, Koch Jessica, Seo Jae Hong, Striecks Christoph, Practical Signatures from Standard Assumptions, Advances in Cryptology – EUROCRYPT 2013 (2013) ISBN:9783642383472 p.461-485, 10.1007/978-3-642-38348-9_28
  8. Boudot Fabrice, Efficient Proofs that a Committed Number Lies in an Interval, Advances in Cryptology — EUROCRYPT 2000 (2000) ISBN:9783540675174 p.431-444, 10.1007/3-540-45539-6_31
  9. Bresson Emmanuel, Stern Jacques, Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications, Lecture Notes in Computer Science (2002) ISBN:9783540442707 p.272-288, 10.1007/3-540-45811-5_21
  10. Brickell, E.F., Chaum, D., Damgård, I., van de Graaf, J.: Gradual and verifiable release of a secret. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 156–166. Springer, Heidelberg (1988)
  11. Camenisch Jan, Chaabouni Rafik, shelat abhi, Efficient Protocols for Set Membership and Range Proofs, Advances in Cryptology - ASIACRYPT 2008 (2008) ISBN:9783540892540 p.234-252, 10.1007/978-3-540-89255-7_15
  12. Camenisch Jan, Hohenberger Susan, Lysyanskaya Anna, Compact E-Cash, Lecture Notes in Computer Science (2005) ISBN:9783540259107 p.302-321, 10.1007/11426639_18
  13. Camenisch Jan, Lysyanskaya Anna, An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, Lecture Notes in Computer Science (2001) ISBN:9783540420705 p.93-118, 10.1007/3-540-44987-6_7
  14. Camenisch Jan, Michels Markus, Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes, Advances in Cryptology — EUROCRYPT ’99 (1999) ISBN:9783540658894 p.107-122, 10.1007/3-540-48910-x_8
  15. Camenisch Jan, , Michels Markus, Separability and Efficiency for Generic Group Signature Schemes, Advances in Cryptology — CRYPTO’ 99 (1999) ISBN:9783540663478 p.413-430, 10.1007/3-540-48405-1_27
  16. Canard Sébastien, Coisel Iwen, Traoré Jacques, Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use, Provable Security ISBN:9783540756699 p.122-137, 10.1007/978-3-540-75670-5_8
  17. Chan Agnes, Frankel Yair, Tsiounis Yiannis, Easy come — Easy go divisible cash, Lecture Notes in Computer Science (1998) ISBN:9783540645184 p.561-575, 10.1007/bfb0054154
  18. Couteau Geoffroy, Peters Thomas, Pointcheval David, Encryption Switching Protocols, Advances in Cryptology – CRYPTO 2016 (2016) ISBN:9783662530177 p.308-338, 10.1007/978-3-662-53018-4_12
  19. Couteau, G., Peters, T., Pointcheval, D.: Removing the strong RSA assumption from arguments over the integers. Cryptology ePrint Archive, Report 2016/128 (2016).
  20. Damgård Ivan, Fujisaki Eiichiro, A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order, Lecture Notes in Computer Science (2002) ISBN:9783540001713 p.125-142, 10.1007/3-540-36178-2_8
  21. Damgård Ivan, Mikkelsen Gert Læssøe, Efficient, Robust and Constant-Round Distributed RSA Key Generation, Theory of Cryptography (2010) ISBN:9783642117985 p.183-200, 10.1007/978-3-642-11799-2_12
  22. Davis Martin, Putnam Hilary, Robinson Julia, The Decision Problem for Exponential Diophantine Equations, 10.2307/1970289
  23. Fujisaki Eiichiro, Okamoto Tatsuaki, Statistical zero knowledge protocols to prove modular polynomial relations, Advances in Cryptology — CRYPTO '97 (1997) ISBN:9783540633846 p.16-30, 10.1007/bfb0052225
  24. Gennaro Rosario, Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks, Advances in Cryptology – CRYPTO 2004 (2004) ISBN:9783540226680 p.220-236, 10.1007/978-3-540-28628-8_14
  25. Groth Jens, Non-interactive Zero-Knowledge Arguments for Voting, Applied Cryptography and Network Security (2005) ISBN:9783540262237 p.467-482, 10.1007/11496137_32
  26. Groth Jens, Linear Algebra with Sub-linear Zero-Knowledge Arguments, Advances in Cryptology - CRYPTO 2009 (2009) ISBN:9783642033551 p.192-208, 10.1007/978-3-642-03356-8_12
  27. Groth Jens, Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments, Lecture Notes in Computer Science (2011) ISBN:9783642253843 p.431-448, 10.1007/978-3-642-25385-0_23
  28. Guajardo Jorge, Mennink Bart, Schoenmakers Berry, Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis, Financial Cryptography and Data Security (2010) ISBN:9783642145766 p.375-382, 10.1007/978-3-642-14577-3_32
  29. Hofheinz Dennis, Jager Tibor, Kiltz Eike, Short Signatures from Weaker Assumptions, Lecture Notes in Computer Science (2011) ISBN:9783642253843 p.647-666, 10.1007/978-3-642-25385-0_35
  30. Hohenberger Susan, Waters Brent, Short and Stateless Signatures from the RSA Assumption, Advances in Cryptology - CRYPTO 2009 (2009) ISBN:9783642033551 p.654-670, 10.1007/978-3-642-03356-8_38
  31. Jarecki Stanislaw, Kiayias Aggelos, Krawczyk Hugo, Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model, Lecture Notes in Computer Science (2014) ISBN:9783662456071 p.233-253, 10.1007/978-3-662-45608-8_13
  32. Jarecki Stanisław, Shmatikov Vitaly, Efficient Two-Party Secure Computation on Committed Inputs, Advances in Cryptology - EUROCRYPT 2007 (2007) ISBN:9783540725398 p.97-114, 10.1007/978-3-540-72540-4_6
  33. Juels Ari, Guajardo Jorge, RSA Key Generation with Verifiable Randomness, Public Key Cryptography (2002) ISBN:9783540431688 p.357-374, 10.1007/3-540-45664-3_26
  34. Kiayias Aggelos, Tsiounis Yiannis, Yung Moti, Traceable Signatures, Advances in Cryptology - EUROCRYPT 2004 (2004) ISBN:9783540219354 p.571-589, 10.1007/978-3-540-24676-3_34
  35. Kim Myungsun, Lee Hyung Tae, Cheon Jung Hee, Mutual Private Set Intersection with Linear Complexity, Information Security Applications (2012) ISBN:9783642278891 p.219-231, 10.1007/978-3-642-27890-7_18
  36. Lipmaa Helger, On Diophantine Complexity and Statistical Zero-Knowledge Arguments, Advances in Cryptology - ASIACRYPT 2003 (2003) ISBN:9783540205920 p.398-415, 10.1007/978-3-540-40061-5_26
  37. Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. Cryptology ePrint Archive, Report 2001/095 (2001).
  38. Pedersen Torben Pryds, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Advances in Cryptology — CRYPTO ’91 ISBN:9783540551881 p.129-140, 10.1007/3-540-46766-1_9
  39. Pointcheval David, Stern Jacques, Security Proofs for Signature Schemes, Advances in Cryptology — EUROCRYPT ’96 (1996) ISBN:9783540611868 p.387-398, 10.1007/3-540-68339-9_33
  40. Pointcheval David, Stern Jacques, Security Arguments for Digital Signatures and Blind Signatures, 10.1007/s001450010003
  41. Pollett Chris, On the bounded version of Hilbert's tenth problem, 10.1007/s00153-002-0162-y
  42. Rabin Michael O., Shallit Jeffery O., Randomized algorithms in number theory, 10.1002/cpa.3160390713
  43. Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signature and public-key cryptosystems. Commun. Assoc. Comput. Mach. 21(2), 120–126 (1978)