121 search results - page 19 / 25 » Identity-based key agreement protocols from pairings |
104
click to vote
CTRSA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
112
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
CRYPTO
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
100
Voted
PODC
2009
ACM
16 years 5 days ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
104
Voted
CIS
2005
Springer
15 years 5 months ago
2005
Springer
Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain...