Results 1 - 10
of
368
Breaking an Efficient Anonymous Channel
- In EUROCRYPT
, 1995
"... . At Eurocrypt 1993, Park, Itoh, and Kurosawa presented an "all/nothing election scheme and anonymous channel". The schemes are based on the mix-net and the election scheme constructed from this anonymous channel (Chaum 1981). One of the two main improvements is that the messages sent by n ..."
Abstract
-
Cited by 54 (0 self)
- Add to MetaCart
. At Eurocrypt 1993, Park, Itoh, and Kurosawa presented an "all/nothing election scheme and anonymous channel". The schemes are based on the mix-net and the election scheme constructed from this anonymous channel (Chaum 1981). One of the two main improvements is that the messages sent
Fault Tolerant Anonymous Channel
, 1997
"... . Previous anonymous channels, called MIX nets, do not work if one center stops. This paper shows new anonymous channels which allow less than a half of faulty centers. A fault tolerant multivalued election scheme is obtained automatically. A very efficient ZKIP for the centers is also presented. 1 ..."
Abstract
-
Cited by 43 (1 self)
- Add to MetaCart
. Previous anonymous channels, called MIX nets, do not work if one center stops. This paper shows new anonymous channels which allow less than a half of faulty centers. A fault tolerant multivalued election scheme is obtained automatically. A very efficient ZKIP for the centers is also presented. 1
Quasi-anonymous channels
- IN: IASTED CNIS
, 2003
"... Although both anonymity and covert channels are part of the larger topic of information hiding, there also exists an intrinsic linkage between anonymity and covert channels. This linkage was illustrated in [1]; however, [1] just scratched the surface of the interplay between covert channels and anon ..."
Abstract
-
Cited by 25 (2 self)
- Add to MetaCart
Although both anonymity and covert channels are part of the larger topic of information hiding, there also exists an intrinsic linkage between anonymity and covert channels. This linkage was illustrated in [1]; however, [1] just scratched the surface of the interplay between covert channels
Breaking an Efficient Anonymous Channel
- In EUROCRYPT
, 1995
"... At Eurocrypt 1993, Park, Itoh, and Kurosawa presented an "all/nothing election scheme and anonymous channel". The schemes are based on the mix-net and the election scheme constructed from this anonymous channel (Chaum 1981). One of the two main improvements is that the messages sent by nor ..."
Abstract
- Add to MetaCart
At Eurocrypt 1993, Park, Itoh, and Kurosawa presented an "all/nothing election scheme and anonymous channel". The schemes are based on the mix-net and the election scheme constructed from this anonymous channel (Chaum 1981). One of the two main improvements is that the messages sent
The dangers of composing anonymous channels
"... Abstract. We present traffic analyses of two anonymous communications schemes that build on the classic Crowds/Hordes protocols. The AJSS10 [1] scheme combines multiple Crowds-like forward channels with a Hordes reply channel in an attempt to offer robustness in a mobile environment. We show that th ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. We present traffic analyses of two anonymous communications schemes that build on the classic Crowds/Hordes protocols. The AJSS10 [1] scheme combines multiple Crowds-like forward channels with a Hordes reply channel in an attempt to offer robustness in a mobile environment. We show
Policy-Based Anonymous Channels
"... Plain-text abstracts organized by year are available in the directory ..."
Indistinguishability-based Characterization of Anonymous Channels
- IN PROC. OF PRIVACY ENHANCING TECHNOLOGIES WORKSHOP – PET ’ 08, VOLUME 5??? OF LNCS
, 2008
"... We revisit the problem of anonymous communication, in which users wish to send messages to each other without revealing their identities. We propose a novel framework to organize and compare anonymity definitions. In this framework, we present simple and practical definitions for anonymous channels ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
We revisit the problem of anonymous communication, in which users wish to send messages to each other without revealing their identities. We propose a novel framework to organize and compare anonymity definitions. In this framework, we present simple and practical definitions for anonymous channels
Anonymous Channel and Authentication in Wireless Communications
- Comput. Commun
, 1999
"... In this paper, we propose a scheme for providing anonymous channel service in wireless communications. By this service, many interesting applications, such as electronic elections, anonymous group discussions, with user identification confidential can be easily realized. No one can trace a sender&ap ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
In this paper, we propose a scheme for providing anonymous channel service in wireless communications. By this service, many interesting applications, such as electronic elections, anonymous group discussions, with user identification confidential can be easily realized. No one can trace a sender
A Wireless-based Authentication and Anonymous Channels for GSM System
"... Abstract. For mobile roaming environment, the mobile uses visiting network’s services, the mobile station and the visiting network must authenticate each other. We propose a new authentication and anonymous channels protocol for roaming mobile communication. Our scheme can securely apply to GSM and ..."
Abstract
- Add to MetaCart
Abstract. For mobile roaming environment, the mobile uses visiting network’s services, the mobile station and the visiting network must authenticate each other. We propose a new authentication and anonymous channels protocol for roaming mobile communication. Our scheme can securely apply to GSM
Cryptanalysis of anonymous channel protocol for large-scale area in wireless communications, Computer Networks 2003; 43: 777--785
"... Abstract The authentication and anonymous channel protocol for large-scale area in wireless communications proposed in [Proc. Sixth IEEE Symposium on Computers and Communications (ISCCÕ01), 3-5 (2001) 36] by Lin-Jan is analyzed, proving that it is not secure. More precisely, fake anonymous channel ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract The authentication and anonymous channel protocol for large-scale area in wireless communications proposed in [Proc. Sixth IEEE Symposium on Computers and Communications (ISCCÕ01), 3-5 (2001) 36] by Lin-Jan is analyzed, proving that it is not secure. More precisely, fake anonymous
Results 1 - 10
of
368