On the Insecurity of a Server-Aided RSA Protocol

No abstract is available for this paper.

• Publication year

  2001

• Venue

  International Conference on the Theory and Application of Cryptology and Information Security

• Publication date

  2001-12-09

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-45682-1_2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Applied Cryptography

  2018cited by this paper
• Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem

  2002cited by this paper
• The Two Faces of Lattices in Cryptology

  2001cited by this paper
• A sieve algorithm for the shortest lattice vector problem

  2001cited by this paper
• Multi-round passive attacks on server-aided RSA protocols

  2000influential reference
• Cryptanalysis of RSA with Private Key d Less Than N 0

  1999cited by this paper
• Cryptanalysis of RSA with private key d less than N0.292

  1999cited by this paper
• On the Security of Server-Aided RSA Protocols

  1998influential reference
• The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

  1998cited by this paper
• The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure

  1998cited by this paper
• A Survey of Fast Exponentiation Methods

  1998cited by this paper
• Lower Bounds for Discrete Logarithms and Related Problems

  1997cited by this paper
• Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations

  1997cited by this paper
• Attacks on Protocols for Server-Aided RSA Computation

  1992influential reference
• Speeding Up Secret Computations with Insecure Auxiliary Devices

  1988influential reference
• A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms

  1987cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper

• Unforgeability of Blind Schnorr in the Limited Concurrency Setting

  2024cites this paper
• A Novel Homomorphic Computing Approach of Edge Internet of Things

  2023cites this paper
• Development of Cryptography since Shannon

  2022cites this paper
• Methods for secure cloud processing of big data

  2021cites this paper
• Cryptanalysis of Modular Exponentiation Outsourcing Protocols

  2021cites this paper
• Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk)

  2018cites this paper
• Lattice-based digital signature and discrete gaussian sampling. (Signature électronique basée sur les réseaux euclidiens et échantillonnage selon une loi normale discrète)

  2018cites this paper
• CRT-Based Outsourcing Algorithms for Modular Exponentiations

  2016cites this paper
• Contributions à la cryptographie post-quantique

  2016cites this paper
• Conception et optimisation de mécanismes cryptographique anonymes

  2015cites this paper
• Fully Homomorphic Encryption

  2014cites this paper
• Toward Generic Method for Server-Aided Cryptography

  2013cites this paper
• Fully Homomorphic Encryption Algorithm Based on Integer Polynomial Ring

  2012cites this paper
• An Efficient Verifiable Implicit Asking Protocol for Diffie-Hellman Key Exchange

  2011cites this paper
• Faster Fully Homomorphic Encryption

  2010influential citation
• Fully Homomorphic Encryption over the Integers

  2010cites this paper
• Publishing Upper Half of RSA Decryption Exponent

  2010influential citation
• Fully homomorphic encryption using ideal lattices

  2009cites this paper
• On the Analysis of Cryptographic Assumptions in the Generic Ring Model

  2009cites this paper
• Another look at generic groups

  2007cites this paper
• Speeding up Exponentiation using an Untrusted Computational Resource

  2006cites this paper
• Improving secure server performance by re-balancing SSL/TLS handshakes

  2006cites this paper
• How to Securely Outsource Cryptographic Computations

  2005cites this paper
• Server-Aided Verification: Theory and Practice

  2005cites this paper
• Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups

  2002cites this paper
• Security of polynomial transformations of the Diffie-Hellman key

  2000cites this paper