4340 search results - page 512 / 868 » Formal Methods and Cryptography |
203
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
239
click to vote
ACNS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
191
click to vote
EMSOFT
2007
Springer
16 years 26 days ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
175
click to vote
UML
2005
Springer
16 years 5 days ago
2005
Springer
Use cases are a popular method for capturing and structuring software requirements. The informality of use cases is both a blessing and a curse. It enables easy application and lea...
228
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
The importance of re-usable Intellectual Properties (IPs) cores is increasing due to the growing complexity of today's system-on-chip and the need for rapid prototyping. In th...