Sciweavers

49 search results - page 5 / 10
» Anonymity protocols as noisy channels
Sort
View
IJISEC
2007
87views more  IJISEC 2007»
14 years 9 months ago
Breaking four mix-related schemes based on Universal Re-encryption
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...
George Danezis
INFOCOM
2012
IEEE
13 years 8 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
LATINCRYPT
2010
14 years 8 months ago
Mediated Traceable Anonymous Encryption
the full version of the extended abstract which appears in Latincrypt '10 (august 8-11, 2010, Puebla, Mexico) M. Abdalla and P. Barreto Eds., Springer-Verlag, LNCS 6212, pages...
Malika Izabachène, David Pointcheval, Damie...
STOC
1999
ACM
122views Algorithms» more  STOC 1999»
15 years 1 months ago
Oblivious Transfer and Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol t...
Moni Naor, Benny Pinkas
PEWASUN
2004
ACM
15 years 3 months ago
A novel solution for achieving anonymity in wireless ad hoc networks
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...