This paper considers the problem of efficiently generating a sequence of secrets with the special property that the knowledge of one or several secrets does not help an adversary to find the other ones. This is achieved through one-way cross-trees, which may be seen as a multidimensional extension of the so-called one-way chains. In a dual way, some applications require the release of one or se...

The theme, background, and signal music usage history information consists of general such as information, platform sensitive rights management permission range, contract information. If among these is disclosed, disputes trade secrets infringement personal protection between companies or individuals may arise. We propose a selective encryption/decryption method to secure the confidentiality, i...

Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of ...

Qian Wu, Ken Chambliss, Michihisa Umetani, Chieko Mineo, and Philip W. Shaul From Division of Pulmonary and Vascular Biology, Department of Pediatrics University of Texas Southwestern Medical Center, Dallas, Texas 75390 Running head: Non-nuclear ER signaling in endothelium Address correspondence to: Philip W. Shaul, M.D., Division of Pulmonary and Vascular Biology, Department of Pediatrics, Uni...

Given n agents each of which has a secret (a fact not known to anybody else), the classical version of the gossip problem is to achieve shared knowledge of all secrets in a minimal number of phone calls. There exist protocols achieving shared knowledge in 2(n−2) calls: when the protocol terminates everybody knows all the secrets. We generalize that problem and focus on higher-order shared knowl...

It has been observed that often the release of a limited part of an information resource poses no security risks, but the relase of a sufficiently large part of that resource might pose such risks. This problem of controlled disclosure of sensitive information is an example of what is known as the aggregation problem. In this paper we argue that it should be possible to articulate specific secr...

Three high-power studies (N = 3,000 total) demonstrated that asking participants to recall an experience as a manipulation can have unintended consequences. Participants who recalled preoccupying secrets made more extreme judgments of an external environment, supporting the notion that secrecy is burdensome. This influence was found, however, only among a subset of participants (i.e., participa...

The paper challenges the prevalent paradigm that differentiates between the management of a core competence and commodity processes. A case study is conducted to examine the strategic planning and management of a call center to illustrate that a commodity process, such as handling customers’ complaints and enquiries, can be transformed into a core competence, if a clear strategic intent is arti...