Quantum Group Signature Scheme Based on Chinese Remainder Theorem
نویسندگان
چکیده
منابع مشابه
Quantum Group Signature Scheme Based on Chinese Remainder Theorem
A novel quantum group signature scheme is proposed based on Chinese Remainder Theorem (CRT), in order to improve the security of quantum signature. The generation and verification of the signature can be successfully conducted only if all the participants cooperate with each other and with the message owner's and the arbitrator's help. The quantum parallel algorithm is applied to efficiently co...
متن کاملHierarchical Scalable Group Key Management Based on Chinese Remainder Theorem
In this paper, we present a new group key management protocol based on the Chinese Remainder Theorem (CRT), which is developed based on our previous paper [29]. By shifting more computing load onto the key server we optimized the number of re-key broadcast message, user-side key computation and number of key storages. Our protocol, Hierarchical Chinese Remaindering Group Key (HCRGK) Protocol, o...
متن کاملIP traceback based on chinese remainder theorem
IP traceback is a defense method to help a victim to identifying the sources of attacking packets. In this paper, we propose an IP traceback method based on the Chinese Remainder Theorem to require routers to probabilistically mark packets with partial path information when packets traverse routers through the Internet. The routers with the proposed IP traceback method can interoperate seamless...
متن کاملPDF Steganography based on Chinese Remainder Theorem
We propose different approaches of PDF files based steganography, essentially based on the Chinese Remainder Theorem. Here, after a cover PDF document has been released from unnecessary characters of ASCII code A0, a secret message is hidden in it using one of the proposed approaches, making it invisible to common PDF readers, and the file is then transmitted through a non-secure communication ...
متن کاملNetwork Coding Based on Chinese Remainder Theorem
Random linear network code has to sacrifice part of bandwidth to transfer the coding vectors, thus a head of size k log |T | is appended to each packet. We present a distributed random network coding approach based on the Chinese remainder theorem for general multicast networks. It uses a couple of modulus as the head, thus reduces the size of head to O(log k). This makes it more suitable for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering and Applications
سال: 2013
ISSN: 1945-3116,1945-3124
DOI: 10.4236/jsea.2013.65b004