In the RSA signature scheme [17], the secret computation M mod N is the most time consuming operation, where N is the product of two large prime numbers and d is the secret key. To perform this operation is hard for the device with limited computation power, so Matsumoto et al. [13] proposed the idea of server-aided secret computation protocols. In a server-aided secret computation protocol, th...

Assuming that Alice and Bob use a secret noisy channel (modelled by a binary symmetric channel) to send a key, reconciliation is the process of correcting errors between Alice's and Bob's version of the key. This is done by public discussion, which leaks some information about the secret key to an eavesdropper. We show how to construct protocols that leak a minimum amount of information. Howeve...

Recent contributions have uncovered the potential of network coding, i.e. algebraic mixing of multiple information flows in a network, to provide enhanced security in packet oriented wireless networks. We focus on exploiting network coding for secret key distribution in a sensor network with a mobile node. Our main contribution is a set of extensions for a simple XOR based scheme, which is show...

Franciszek Seredynski *, Pascal Bouvry , Albert Y. Zomaya d a Polish–Japanese Institute of Information Technologies, Koszykowa 86, 02-008 Warsaw, Poland b Institute of Computer Science of Polish Academy of Sciences, Ordona 21, 01-237 Warsaw, Poland c Faculty of Sciences, Technology and Communication, Luxembourg University 6, rue Coudenhove Kalergi, L-1359 Luxembourg-Kirchberg, Luxembourg d Scho...

We present a subtle idea to economically improve message-unilaterally-transmitted quantum secure direct communication (QSDC) protocols to realize two-way secure direct communication. Suppose Alice and Bob securely share a secret key. When the message sender, say, Alice, wants to send her secret messages to Bob, she can first use the secret key to encrypt her secret messages, then she publicly s...

Multivariate Public Key Cryptosystems (MPKC) is one of candidates for post-quantum cryptography. Rainbow is an MPKC digital signature scheme, with relatively efficient encryption and decryption processes. However, the size of the secret key of Rainbow is substantially larger than that of an RSA cryptosystem for the same security level. By using sparse secret keys, the size of the secret key of ...