4 search results - page 1 / 1 » Polynomially Uncomputable Number-Theoretic Problems in Crypt... |
FCS
2006
13 years 6 months ago
2006
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
WCC
2005
Springer
13 years 10 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
PAIRING
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
FC
1998
Springer
13 years 9 months ago
1998
Springer
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...