Sciweavers

225 search results - page 38 / 45
» Weakly-Private Secret Sharing Schemes
Sort
View
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
14 years 25 days ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
SASO
2008
IEEE
14 years 1 months ago
A Framework for Self-Protecting Cryptographic Key Management
Demands to match security with performance in Web applications where access to shared data needs to be controlled dynamically make self-protecting security schemes attractive. Yet...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl,...
ICPADS
2010
IEEE
13 years 5 months ago
Utilizing RF Interference to Enable Private Estimation in RFID Systems
Counting or estimating the number of tags is crucial for RFID system. Researchers have proposed several fast cardinality estimation schemes to estimate the quantity of a batch of ...
Lei Yang, Jinsong Han, Yong Qi, Cheng Wang, Zhuo L...
INFOCOM
2009
IEEE
14 years 2 months ago
Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance
Abstract—Recently, distributed data storage has gained increasing popularity for efficient and robust data management in wireless sensor networks (WSNs). But the distributed arc...
Qian Wang, Kui Ren, Wenjing Lou, Yanchao Zhang
DEXAW
2009
IEEE
124views Database» more  DEXAW 2009»
14 years 2 months ago
Performance Comparison of Secure Comparison Protocols
Secure Multiparty Computation (SMC) has gained tremendous importance with the growth of the Internet and E-commerce, where mutually untrusted parties need to jointly compute a fun...
Florian Kerschbaum, Debmalya Biswas, Sebastiaan de...