Sciweavers

5476 search results - page 828 / 1096
» Resettably Secure Computation
Sort
View
PAIRING
2010
Springer
155views Cryptology» more  PAIRING 2010»
15 years 4 months ago
Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
Brian J. Matt
CONEXT
2009
ACM
15 years 4 months ago
Lockr: better privacy for social networks
Today's online social networking (OSN) sites do little to protect the privacy of their users' social networking information. Given the highly sensitive nature of the inf...
Amin Tootoonchian, Stefan Saroiu, Yashar Ganjali, ...
237
Voted
ICNP
2009
IEEE
15 years 4 months ago
DirCast: A Practical and Efficient Wi-Fi Multicast System
Abstract--IP multicast applications such as live lecture broadcasts are being increasingly used in enterprise and campus networks. In many cases, end hosts access these multicast s...
Ranveer Chandra, Sandeep Karanth, Thomas Moscibrod...
DIMVA
2011
14 years 10 months ago
Code Pointer Masking: Hardening Applications against Code Injection Attacks
In this paper we present an efficient countermeasure against code injection attacks. Our countermeasure does not rely on secret values such as stack canaries and protects against a...
Pieter Philippaerts, Yves Younan, Stijn Muylle, Fr...
IACR
2011
133views more  IACR 2011»
14 years 6 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti