نتایج جستجو برای: minimal authorized subsets

تعداد نتایج: 199025  

1998
Kenro Aihara Atsuhiro Takasu

In this paper, we show our visualization approach for supporting interactive document retrieval based on authorized documents, such as survey articles or domain dictionaries. We assume that it is effective for accessing the required information sources that the system let users recognize the information space inclusively. Our research, therefore, aims to support users to access the information ...

2007
Jacob Steinhardt Thomas Jefferson

We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first is a characterization of minimal conjugate generating sets of Sn. The second is a generalization of a result due to Feng characterizing the automorphism g...

2008
Jacob Steinhardt Thomas Jefferson

We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first is a characterization of minimal conjugate generating sets of Sn. The second is a generalization of a result due to Feng characterizing the automorphism g...

Journal: :Forum of Mathematics, Sigma 2022

Abstract We show that the universal minimal proximal flow and strongly of a discrete group can be realized as Stone spaces translation-invariant Boolean algebras subsets satisfying higher-order notion syndeticity. establish algebraic, combinatorial topological dynamical characterizations these we use to obtain new necessary sufficient conditions for strong amenability amenability. also characte...

2015
HIROKI MATUI

We study universal properties of locally compact G-spaces for countable infinite groups G. In particular we consider open invariant subsets of the G-space βG, and their minimal closed invariant subspaces. These are locally compact free G-spaces, and the latter are also minimal. We examine the properties of these G-spaces with emphasis on their universal properties. As an example of our results,...

Journal: :Security and Communication Networks 2016
Ruxandra F. Olimid

Secret sharing schemes divide a secret among multiple participants so that only authorized subsets of parties can reconstruct it. We show that SETUP (Secretly Embedded Trapdoor with Universal Protection) attack can be embedded in secret sharing schemes that employ enough randomness to give the attacker an overwhelming advantage to access the secret. In case of ideal schemes, a coalition of a fe...

2012
Sonali Patil Prashant Deshmukh E. D. Karnin J. W. Greene Chunming Tang Zheng-an Yao Yung-Chen Chou Chih-Hung Lin Pao-Ching Li Yu-Chiang Li Runhua Shi Hong Zhong Chao-Wen Chan Chin-Chen Chang Zhi-Hui Wang Mitsuru Ito Akira Saito Takao Nishizeki K. Srinathan N. Tharani Rajan

The idea of secret sharing is to start with a secret, divide it into pieces called shares, which are then distributed amongst participants by the dealer. Only certain authorized subsets of participants can reconstruct the original secret. Applications for secret sharing schemes seem to be getting more important nowadays. For many circumstances, secret sharing has to provide more flexibility and...

2010
Alessandro Colantonio Roberto Di Pietro Alberto Ocello Nino Vincenzo Verde

Role-based access control is widely accepted as a best practice to effectively limit system access to authorized users only. To enhance benefits, the role definition process must count on business requirements. Role mining represents an essential tool for role engineers, but most of the existing techniques cannot elicit roles with an associated clear business meaning. To this end, we propose a ...

Journal: :Entropy 2017
Johannes Rauh

Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the secret. Thus, secret sharing schemes are systems of variables in which it is very clearly specified which subsets have information about the secret. As such, the...

2014
Yuri Malitsky Barry O'Sullivan Alessandro Previti Joao Marques-Silva

Constraint satisfaction has become ubiquitous in the modern world, able to model and offer solution techniques for many of the most pressing problems. However, no matter how good the techniques become, some problems just do not have a satisfiable solution, and are referred to as inconsistent. Yet even when such problems are considered, one is still interested in finding the minimal subset of co...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید