294 search results - page 45 / 59 » Efficient Confirmer Signatures from the |
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
TCIAIG
2010
13 years 4 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
EUROCRYPT
2009
Springer
14 years 10 months ago
2009
Springer
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
PKC
1998
Springer
14 years 2 months ago
1998
Springer
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...