Sciweavers

1992 search results - page 177 / 399
» On the (limited) power of non-equivocation
Sort
View
PKC
2007
Springer
135views Cryptology» more  PKC 2007»
16 years 20 days ago
A Direct Anonymous Attestation Scheme for Embedded Devices
Abstract. Direct anonymous attestation (DAA) is an anonymous authentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. Th...
He Ge, Stephen R. Tate
STACS
2007
Springer
16 years 20 days ago
A New Rank Technique for Formula Size Lower Bounds
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
Troy Lee
TAMC
2007
Springer
16 years 20 days ago
A Characterization of the Language Classes Learnable with Correction Queries
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
Cristina Tîrnauca, Satoshi Kobayashi
WWIC
2007
Springer
221views Communications» more  WWIC 2007»
16 years 20 days ago
Detection of Packet Forwarding Misbehavior in Mobile Ad-Hoc Networks
Mobile Ad Hoc networks (MANETs) are susceptible to having their effective operation compromised by a variety of security attacks. Nodes may misbehave either because they are malici...
Oscar F. Gonzalez, Michael P. Howarth, George Pavl...
APSEC
2006
IEEE
16 years 18 days ago
An Accurate and Convenient Undo Mechanism for Refactorings
Refactoring makes existing source code more understandable and reusable without changing observable behavior. Therefore, applying refactorings to existing source code and reversin...
Katsuhisa Maruyama