Sciweavers

1656 search results - page 203 / 332
» Secure Computation Without Authentication
Sort
View
OSDI
2006
ACM
16 years 1 months ago
Securing Software by Enforcing Data-flow Integrity
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
Manuel Costa, Miguel Castro, Timothy L. Harris
WMCSA
2009
IEEE
15 years 8 months ago
We saw each other on the subway: secure, anonymous proximity-based missed connections
There is an inherent tension between the value provided by Location-Based Services (LBSs) and the location-privacy concerns they raise. Unfortunately, users are often forced to ei...
Justin Manweiler, Ryan Scudellari, Zachary Cancio,...
IACR
2011
133views more  IACR 2011»
14 years 24 days ago
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
Craig Costello, Kristin Lauter, Michael Naehrig
FOCS
2002
IEEE
15 years 6 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
CSREASAM
2006
15 years 2 months ago
Enhanced Group Key Generation Protocol
Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, th...
Sunghyuck Hong, Noé Lopez-Benitez