Abstract This paper considers secret-key generation between several agents and a base station that observe independent and identically distributed realizations of correlated random variables. Each agent wishes to generate the longest possible individual key with the base station by means of public communication. All keys must be jointly kept secret from all external entities. Also each agent ha...

Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. Traditionally, PSS schemes are developed for the Shamir’s SSS which is a single SSS. Bai (2006) developed a multiple-secret sharing scheme using matrix projection. This ...

We propose a quantum authentication protocol that is robust against the theft of secret keys. In the protocol, disposable quantum passwords prevent impersonation attacks with stolen secret keys. The protocol also prevents the leakage of secret information of a certification agent. [email protected] [email protected]

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

This paper addresses the question of multi-party computation in a model with asymmetric information. Each agent has a private value (secret), but in contrast to standard models, the agent incurs a cost when retrieving the secret. There is a social choice function the agents would like to compute and implement. All agents would like to perform a joint computation, which input is their vector of ...

Steganography is the art and science of hiding information. This paper introduces eForensics as a novel technique for extracting secret information electronically encoded in most creative ways. We propose an e-Forensics system capable to detect (or extract) secret information using any generic steganalytic algorithm. The system is based on agent computing approach where the autonomic agent woul...

The paper presents two new methods for providing mobile agents with privacy and anynomity. The proposed schemes are based on different cryptographic primitives: a secret-sharing scheme and a zerokonwledge proof.

THRESHOLD CRYPTOGRAPHY WITH CHINESE REMAINDER THEOREM Kamer Kaya Ph.D. in Computer Engineering Supervisor: Asst. Prof. Dr. Ali Aydın Selçuk August, 2009 Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. However, no ...