A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Authenticated Query Flooding in Sensor Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Secure acknowledgment aggregation and multisignatures with limited robustness
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Scalability and security in biased many-to-one communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure many-to-one symbol transmission for implementation on smart cards
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure acknowledgment of multicast messages in open peer-to-peer networks
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Aggregated hierarchical multicast-a many-to-many communication paradigm using programmable networks
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Asymmetric homomorphisms for secure aggregation in heterogeneous scenarios
Information Fusion
Hi-index | 0.24 |
In secure many-to-one communications, a set of nodes transmit data to the same receiver. Research in this area focuses on increasing scalability by minimizing the amount of data reaching the receiver. Current proposals for secure many-to-one transmission use costly cryptographic operations. In this paper, we present a novel system for secure many-to-one symbol transmission in which nodes are only required to perform lightweight operations. This makes it suitable for implementation in resource-constrained scenarios such as sensor networks.