Keeping secrets from parents is associated with depression and antisocial behavior. The current study tested whether keeping secrets from best friends is similarly linked to maladjustment, and whether associations between secrecy and maladjustment are moderated by the quality of the friendship. Adolescents (N = 181; 51% female, 48% white, non-Hispanic, 45% African American) reported their secre...

Secure two-party protocols are of significant research and application value. All-or-Nothing Disclosure of Secrets (ANDOS) is such a kind of cryptographic task. It involves two parties, a vendor and a buyer. The vendor, say Alice, who disposes of several secrets and is willing to sell any of them to the buyer, say Bob, with the guarantee that no information about the other secrets will be obtai...

a. Rationale for protection. The protection of confidential business information dates at least to Roman law, which afforded relief against a person who induced another's employee to divulge secrets relating to the master's commercial affairs. The modern law of trade secrets evolved in England in the early 19th century, apparently in response to the growing accumulation of technical know-how an...

Generalized secret sharing is a method of constructing secret sharing from the perspective of access structure. In this paper, we propose a novel solution for achieving generalized secret sharing with linear hierarchical secrets. We use a matrix to model the relationship related to the access structure and transfer the matrix to modular arithmetic, which is calculated by Chinese Remainder Theor...

The explosive power of people’s secrets and lies will once again take center stage in season two of ABC’s hit drama, “Secrets and Lies.” No matter who you are, everyone has secrets and everybody tells lies. What will people do to keep their most intimate, devastating indiscretions from ruining their lives? The unflappable and formidable Detective Andrea Cornell (Juliette Lewis) is back. She is ...

We consider the following game introduced by Chung, Graham, and Leighton in [Chung et al. 01]. One player, A, picks k > 1 secrets from a universe of N possible secrets, and another player, B, tries to gain as much information about this set as possible by asking binary questions f : [N ] −→ {0, 1}. Upon receiving a question f , A adversarially chooses one of her k secrets, and answers f accordi...

We consider the problem of answering queries against a knowledge base (KB) using secrets, whenever it is possible to do so without compromising secrets. We study query answering against EL knowledge bases. We provide a polynomial time algorithm that, given an EL KB Σ, a set S of secrets to be protected and a query q or the form C(a) or r(a, b), outputs “Yes” whenever Σ q and the answer to q, to...

Alice has n secrets which she regards as equally valuable. She is willing to sell any of them to Bob, but wants to ensure that if he pays for only one secret he cannot obtain any information about the others. Bob would like to buy one of the secrets from Alice, but wants to ensure that Alice can obtain no information about which of her secrets he has obtained. The aim of an all-or-nothing discl...

This paper describes biometric-based cryptographic techniques that use weak secrets to provide strong, multi-factor and mutual authentication, and establish secure channels for subsequent communications. These techniques rely on lightweight cryptographic algorithms for confidential information exchange. Lightweight algorithms are suitable for use in resource constrained environments such as the...