Sciweavers

346 search results - page 12 / 70
» The Secret Santa Problem
Sort
View
AINA
2005
IEEE
14 years 3 months ago
Efficient Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chu-Hsing Lin, Wei Lee
MST
2008
80views more  MST 2008»
13 years 9 months ago
A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange
Abstract The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards...
Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
JOC
2007
125views more  JOC 2007»
13 years 9 months ago
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
Jean-Sébastien Coron, Alexander May
AINA
2004
IEEE
14 years 1 months ago
Supervising Secret-Key Agreements in a Level-Based Hierarchy
A key agreement protocol is utilized in a network system such that two users are able to establish a commonly shared secret key. Entities within the same security level can commun...
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
ACSAC
2010
IEEE
13 years 7 months ago
Keeping data secret under full compromise using porter devices
We address the problem of confidentiality in scenarios where the attacker is not only able to observe the communication between principals, but can also fully compromise the commu...
Christina Pöpper, David A. Basin, Srdjan Capk...