Sciweavers

391 search results - page 34 / 79
» On-Line Secret Sharing
Sort
View
JDWM
2006
178views more  JDWM 2006»
13 years 7 months ago
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining ta...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
SCN
2008
Springer
141views Communications» more  SCN 2008»
13 years 7 months ago
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
In 2004, Molnar and Wagner introduced a very appealing scheme dedicated to the identification of RFID tags. Their protocol relies on a binary tree of secrets which are shared
Julien Bringer, Hervé Chabanne, Thomas Icar...
EUROCRYPT
2009
Springer
14 years 8 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
AINA
2004
IEEE
13 years 11 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
INFOCOM
2011
IEEE
12 years 11 months ago
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
Qian Wang, Hai Su, Kui Ren, Kwangjo Kim