Sciweavers

130 search results - page 8 / 26
» How to Encrypt with a Malicious Random Number Generator
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Ring Signatures of Sub-linear Size Without Random Oracles
Ring signatures, introduced by Rivest, Shamir and Tauman, enable a user to sign a message anonymously on behalf of a “ring”. A ring is a group of users, which includes the sign...
Nishanth Chandran, Jens Groth, Amit Sahai
CPC
2006
93views more  CPC 2006»
13 years 7 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
FSE
2009
Springer
159views Cryptology» more  FSE 2009»
14 years 2 months ago
Intel's New AES Instructions for Enhanced Performance and Security
The Advanced Encryption Standard (AES) is the Federal Information Processing Standard for symmetric encryption. It is widely believed to be secure and efficient, and is therefore b...
Shay Gueron
INFOCOM
2011
IEEE
12 years 11 months ago
Maintaining source privacy under eavesdropping and node compromise attacks
—In a sensor network, an important problem is to provide privacy to the event detecting sensor node and integrity to the data gathered by the node. Compromised source privacy can...
Kanthakumar Pongaliur, Li Xiao
DIMVA
2011
12 years 11 months ago
Timing Attacks on PIN Input in VoIP Networks (Short Paper)
To access automated voice services, Voice over IP (VoIP) users sometimes are required to provide their Personal Identification Numbers (PIN) for authentication. Therefore when the...
Ge Zhang, Simone Fischer-Hübner