Anonymous Multipath Routing Protocol Based on Secret Sharing in Mobile Ad Hoc Networks

Chen, Siguang; Wu, Meng

doi:10.1109/icmtma.2010.602

Cited by 11 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Data anonymization is widely used method for safeguarding data against undesired leakage [6] [8]. [6] uses cryptographic techniques and secret sharing to provide identity, location, traffic and data anonymity. [8] presents a data-centric trust, where trust in each individual piece of data is computed; then multiple, related but possibly contradictory, data are combined.…”

Section: Some Of the Existing Workmentioning

confidence: 99%

Privacy Preservation within Stock Market

Bhati¹,

Venkataram²

2017

dtcse

View full text Add to dashboard Cite

In stock market, the data contain sensitive information, and undesired disclosure of this information can lead to various attacks, thus breaching privacy and causing severe damage to the users. We propose a data privacy preservation scheme within stock market, where rough set theory concepts are utilized to anonymize the data during data transfer in stock market. The proposed data privacy preservation scheme is tested by considering several case studies of a stock market. The simulation results show the effectiveness of proposed scheme.

show abstract

Section: Some Of the Existing Workmentioning

confidence: 99%

Privacy Preservation within Stock Market

Bhati¹,

Venkataram²

2017

dtcse

View full text Add to dashboard Cite

show abstract

“…MASK [54] and D-ANODR [52] contain the final destination in the clear in each RREQ message. AMRSS [14] and ARMR [17] utilizes multiple paths for routing. AMRSS [14] assumes that the entire network shares a pair of public-private keys and that the destination ID will be encrypted using such a key.…”

Section: Related Workmentioning

confidence: 99%

“…AMRSS [14] and ARMR [17] utilizes multiple paths for routing. AMRSS [14] assumes that the entire network shares a pair of public-private keys and that the destination ID will be encrypted using such a key. AMRSS also includes the entire path encrypted under the network key in each data message.…”

Section: Related Workmentioning

confidence: 99%

ALARM: Anonymous Location-Aided Routing in Suspicious MANETs

Defrawy

Tsudik

2011

IEEE Trans. on Mobile Comput.

103

View full text Add to dashboard Cite

In most common mobile ad-hoc networking (MANET) scenarios, nodes establish communication based on long-lasting public identities. However, in some hostile and suspicious settings, node identities must not be exposed and node movements should be untraceable. Instead, nodes need to communicate on the basis of their current locations. While such MANET settings are not very common, they do occur in military and law enforcement domains and require high security and privacy guarantees. In this paper, we address a number of issues arising in suspicious location-based MANET settings by designing and analyzing a privacy-preserving and secure linkstate based routing protocol (ALARM). ALARM uses nodes' current locations to securely disseminate and construct topology snapshots and forward data. With the aid of advanced cryptographic techniques (e.g, group signatures), ALARM provides both security and privacy features, including: node authentication, data integrity, anonymity and untraceability (trackingresistance). It also offers protection against passive and active insider and outsider attacks. To the best of our knowledge, this work represents the first comprehensive study of security, privacy and performance trade-offs in the context of link-state MANET routing.

show abstract

“…Parakh and Kak [24] proposed a space efficient SS scheme, in which k secrets can be divided into n shares, where k ≤ n. Their method can be used for secure parallel communication and online data storage. Chen and Wu [25] presented an anonymous multipath routing protocol based on SS in mobile ad hoc networks. The protocol can provide high security by preventing passive attacks and reduce the successful probability of active attacks.…”

Section: Introductionmentioning

confidence: 99%

An authenticated group key distribution mechanism using theory of numbers

Liu

Harn

Chang

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARY A group key distribution protocol can enable members of a group to share a secret group key and use it for secret communications. In 2010, Harn and Lin proposed an authenticated group key distribution protocol using polynomial‐based secret sharing scheme. Recently, Guo and Chang proposed a similar protocol based on the generalized Chinese remainder theorem. In this paper, we point out that there are some security problems of Guo and Chang's protocol and propose a simpler authenticated group key distribution protocol based on the Chinese remainder theorem. The confidentiality of our proposed protocol is unconditionally secure. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Anonymous Multipath Routing Protocol Based on Secret Sharing in Mobile Ad Hoc Networks

Cited by 11 publications

References 16 publications

Privacy Preservation within Stock Market

Privacy Preservation within Stock Market

ALARM: Anonymous Location-Aided Routing in Suspicious MANETs

An authenticated group key distribution mechanism using theory of numbers

Contact Info

Product

Resources

About