ABSTRACT

In online surveys, many people are not willing to provide true answers due to
privacy concerns. Thus, anonymity is important for online message collection. Existing
solutions let each member blindly shuffle the submitted messages by using the IND-
CCA2 secure cryptosystem. In the end, all messages are randomly shuffled and no one
knows the message order. However, the heavy computational overhead and linear
communication rounds make it only useful for small groups. In this paper, we propose an
efficient anonymous message submission protocol aimed at a practical group size. Our
protocol is based on a simplified secret sharing scheme and a symmetric key
cryptosystem. We propose a novel method to let all members secretly aggregate their
messages into a message vector such that a member knows nothing about other members’
message positions. We provide a theoretical proof showing that our protocol is
anonymous under malicious attacks. We then conduct a thorough analysis of our
protocol, showing that our protocol is computationally more efficient than existing
solutions and results in a constant communication rounds with a high probability.

EXISTING SYSTEM
Existing solutions let each member blindly shuffle the submitted messages by
using the IND-CCA2 secure cryptosystem. In the end, all messages are randomly
shuffled and no one knows the message order. However, the heavy computational
overhead and linear communication rounds make it only useful for small groups.

PROPOSED SYSTEM

We propose an efficient anonymous message submission protocol aimed at a practical

group size. Our protocol is based on a simplified secret sharing scheme and a symmetric
key cryptosystem. We propose a novel method to let all members secretly aggregate their
messages into a message vector such that a member knows nothing about other members’
message positions. We provide a theoretical proof showing that our protocol is
anonymous under malicious attacks. We then conduct a thorough analysis of our
protocol, showing that our protocol is computationally more efficient than existing
solutions and results in a constant communication rounds with a high probability. We
propose security sharing scheme using some protocol.
Advantages
1. Security sharing scheme.
2. Avoid under malicious attacks
MODULE DESCRIPTION:
1. Data Aggregation

2. Symmetric Key Cryptosystem

3. Data collector Module

Data Aggregation
The process of redefining data into a summarization based on some rules or criteria.
Aggregation may also encompass de-normalization for data access and retrieval. Data
aggregation combines the original order of data and collect fields in different table.
Symmetric Key Cryptosystem
Symmetric key cryptosystem, using our encryption and decryption. First, for the
same level of security, the symmetric key cryptosystem requires a smaller secret key
length. Furthermore, the encryption and decryption of the symmetric key cryptosystem is
much faster. We require that the cryptosystem be semantically secure, AES-128 under the
cipher block chaining counter mode meets this requirement.
Data collector Module
Collector collects the detail from user using shaking and shuffling activities. And
retrieve the information using data aggregation method. Collector after collect the data
forward to admin.
System Configuration:-

H/W System Configuration:-

Processor - Pentium –III

Speed - 1.1 Ghz

RAM - 256 MB(min)

Hard Disk - 20 GB

Floppy Drive - 1.44 MB

Key Board - Standard Windows Keyboard

Mouse - Two or Three Button Mouse

Monitor - SVGA

S/W System Configuration:-

 Operating System :Windows95/98/2000/XP

 Application Server : Wamp2.2e

 Front End : HTML, CSS

 Scripts : JavaScript.

 Server side Script : PHP.

 Database : Mysql
CONCLUSION

We have proposed an efficient online anonymous message protocol. Utilizing

the simplified secret sharing scheme, we have presented a novel position application
technique, in which all members secretly select their positions in a position vector, such
that a member knows nothing about the other members’ message positions. We have
introduced a data aggregation technique, in which all members aggregate their messages
into a message vector and submit it to the collector without exposing their identities. We
have theoretically proved that our protocol is anonymous under malicious attacks. Our
efficiency analysis and simulation have shown that our protocol is computationally more
efficient than existing works and requires a constant communication rounds on average.