679 search results - page 15 / 136 » Using decision problems in public key cryptography |
CCS
2003
ACM
15 years 4 months ago
2003
ACM
We describe a new method for protecting the anonymity of message receivers in an untrusted network. Surprisingly, existing methods fail to provide the required level of anonymity ...
101
Voted
ESAS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this article we present the fastest known implementation of a modular multiplication for a 160-bit standard compliant elliptic curve (secp160r1) for 8-bit micro contro...
108
click to vote
SIAMCOMP
2008
14 years 11 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
93
Voted
EUROCRYPT
2009
Springer
16 years 7 days 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...
91
Voted
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
A project to enable health care professionals (GPs, practice nurses and diabetes nurse specialists) to access, via the Internet, confidential patient data held on a secondary care...