4330 search results - page 522 / 866 » Analyzing security architectures |
203
click to vote
EUROCRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
275
Voted
OOPSLA
2000
Springer
15 years 11 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
197
click to vote
ACSAC
2008
IEEE
15 years 9 months ago
2008
IEEE
Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Mea...
191
click to vote
CRYPTO
2008
Springer
15 years 9 months ago
2008
Springer
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
217
click to vote
EUROISI
2008
15 years 9 months ago
2008
Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...