25 search results - page 1 / 5 » Secure Distributed Linear Algebra in a Constant Number of Ro... |
CRYPTO
2001
Springer
13 years 10 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptogr...
CTRSA
2009
Springer
14 years 4 days ago
2009
Springer
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
SP
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...