947 search results - page 17 / 190 » Provable Implementations of Security Protocols |
NDSS
2009
IEEE
15 years 6 months ago
2009
IEEE
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
112
click to vote
SIGSOFT
2007
ACM
16 years 14 days ago
2007
ACM
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...
111
click to vote
ICSE
2009
IEEE-ACM
14 years 9 months ago
2009
IEEE-ACM
Verifying security properties of protocols requires developers to manually create protocol-specific intruder models, which could be tedious and error prone. We present Slede, a ve...
104
click to vote
SCN
2008
Springer
14 years 11 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...