1414 search results - page 139 / 283 » Randomness and Universal Machines |
98
Voted
EUROCRYPT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
102
Voted
IFL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
101
Voted
WINE
2007
Springer
15 years 6 months ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
92
Voted
CCS
2005
ACM
15 years 6 months ago
2005
ACM
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
127
Voted
CTRSA
2005
Springer
15 years 6 months ago
2005
Springer
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...