Sciweavers

26354 search results - page 292 / 5271
» How we refactor, and how we know it
Sort
View
DIM
2008
ACM
15 years 8 months ago
Minimal information disclosure with efficiently verifiable credentials
Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). However, plain certificates provide a binary ide...
David Bauer, Douglas M. Blough, David Cash
EUROCRYPT
2008
Springer
15 years 8 months ago
The Twin Diffie-Hellman Problem and Applications
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
David Cash, Eike Kiltz, Victor Shoup
ESANN
2007
15 years 8 months ago
Causality analysis of LFPs in micro-electrode arrays based on mutual information
Since perceptual and motor processes in the brain are the result of interactions between neurons, layers and areas, a lot of attention has been directed towards the development of...
Nikolay V. Manyakov, Marc M. Van Hulle
ANLP
1994
155views more  ANLP 1994»
15 years 8 months ago
Guided Sentences Composition for Disabled People
We present the advantages of guided sentences composition for communicating in natural language with computers. We show how guidance can be achieved by means of the partial synthe...
Robert Pasero, Nathalie Richardet, Paul Sabatier
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti