227 search results - page 21 / 46 » On the Reachability Problem in Cryptographic Protocols |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a s...
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
ECCC
2007
13 years 7 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
SP
1996
IEEE
13 years 11 months ago
1996
IEEE
Recently, two major bankcard payment instrument operators VISA and MasterCard published speci cations for securing bankcard payment transactions on open networks for open scrutiny...
ISCC
2007
IEEE
14 years 1 months ago
2007
IEEE
— It is possible to show that well-known attacks on authentication protocols are flawed. This is a problem, since good protocols may thus be dismissed rather than improved and p...