157 search results - page 12 / 32 » A Universally Composable Mix-Net |
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
IJISEC
2007
13 years 7 months ago
2007
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
CRYPTO
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
MAGS
2006
13 years 7 months ago
2006
A mobile multi-agent system is proposed to create solutions for the university course timetabling problem. It is composed of four kinds of agents: (mobile) Course Agents, and (stat...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...