Sciweavers

5476 search results - page 175 / 1096
» Resettably Secure Computation
Sort
View
143
Voted
CCS
2010
ACM
15 years 11 months ago
Bureaucratic protocols for secure two-party sorting, selection, and permuting
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenlia...
151
Voted
EUROCRYPT
2006
Springer
15 years 8 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
GPC
2009
Springer
15 years 2 months ago
Integrity Assurance Technique Using Determinant Approach
Data integrity is an important aspect of storage security and reliability which are prerequisite for most computer systems and network applications. This paper proposes a new tech...
Jasim A. Ghaeb
141
Voted
EUC
2006
Springer
15 years 8 months ago
Energy Comparison of AES and SHA-1 for Ubiquitous Computing
Wireless sensor networks and Radio Frequency Identifiers are becoming mainstream applications of ubiquitous computing. They are slowly being integrated into our infrastructure and ...
Jens-Peter Kaps, Berk Sunar
TRUST
2010
Springer
15 years 9 months ago
Token-Based Cloud Computing
Secure outsourcing of computation to an untrusted (cloud) service provider is becoming more and more important. Pure cryptographic solutions based on fully homomorphic and verifia...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Marcel ...