2079 search results - page 270 / 416 » Universality of random graphs |
117
click to vote
ICCCN
2007
IEEE
15 years 11 months ago
2007
IEEE
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
129
click to vote
EUROCRYPT
2007
Springer
15 years 10 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...
138
click to vote
IFL
2007
Springer
15 years 10 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...
125
click to vote
CCS
2005
ACM
15 years 10 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...
167
click to vote
CTRSA
2005
Springer
15 years 10 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...