133 search results - page 24 / 27 » On the security of linear consensus networks |
114
click to vote
PLDI
2006
ACM
15 years 5 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
IJNSEC
2007
14 years 11 months ago
2007
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
105
click to vote
ASIACRYPT
2004
Springer
15 years 5 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...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...