Sciweavers

212 search results - page 35 / 43
» Anonymity and k-Choice Identities
Sort
View
ASIACRYPT
2009
Springer
14 years 2 months ago
Group Encryption: Non-interactive Realization in the Standard Model
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
Julien Cathalo, Benoît Libert, Moti Yung
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 1 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...

Book
3022views
15 years 3 months ago
Algorithms for Programmers
"This is the (work in progress) book "Algorithms for Programmers". Publication as soon as possible, content is (modulo copy editing) close to final version. I will p...
Jörg Arndt
ISI
2003
Springer
14 years 20 days ago
Authorship Analysis in Cybercrime Investigation
Criminals have been using the Internet to distribute a wide range of illegal materials globally in an anonymous manner, making criminal identity tracing difficult in the cybercrime...
Rong Zheng, Yi Qin, Zan Huang, Hsinchun Chen
EUROCRYPT
2004
Springer
14 years 26 days ago
Traceable Signatures
Abstract. This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation. To this end, we develop the unde...
Aggelos Kiayias, Yiannis Tsiounis, Moti Yung