Sciweavers

37 search results - page 7 / 8
» Efficient Secure Auction Protocols Based on the Boneh-Goh-Ni...
Sort
View
HASE
2008
IEEE
14 years 1 months ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
CCS
2008
ACM
13 years 9 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
GLOBECOM
2010
IEEE
13 years 5 months ago
Constructing Secure Localization Systems with Adjustable Granularity Using Commodity Hardware
Proof of a user's identity is not always a sufficient means for making an authorization decision. In an increasing set of circumstances, knowledge of physical location provide...
Patrick Traynor, Joshua Schiffman, Thomas F. La Po...
CNSR
2008
IEEE
214views Communications» more  CNSR 2008»
14 years 1 months ago
HGKM: A Group-Based Key Management Scheme for Sensor Networks Using Deployment Knowledge
Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of t...
Ngo Trong Canh, Young-Koo Lee, Sungyoung Lee
ASIACRYPT
2006
Springer
13 years 11 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth