1777 search results - page 206 / 356 » Programming Cryptographic Protocols |
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
ACSAC
2000
IEEE
14 years 1 months ago
2000
IEEE
The widespread use of public networks, such as the Internet, for the exchange of sensitive data, like legally valid documents and business transactions, poses severe security cons...
ACISP
2000
Springer
14 years 1 months ago
2000
Springer
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the “market” for monetary influence in political campaigns. ...
EUROCRYPT
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...