Sciweavers

101 search results - page 9 / 21
» Extended visual cryptography schemes
Sort
View
VISUALIZATION
1993
IEEE
15 years 1 months ago
Visualization of Time-Dependent Flow Fields
We present an interactive visualization approach for the dense representation of unsteady 3D flow fields. The first part of this approach is a GPU-based 3D texture advection schem...
David A. Lane
CHES
2009
Springer
265views Cryptology» more  CHES 2009»
15 years 10 months ago
Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
Differential Power Analysis (DPA) is a powerful side channel key recovery attack that efficiently breaks block ciphers implementations. In software, two main techniques are usually...
Matthieu Rivain, Emmanuel Prouff, Julien Doget
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 3 months ago
Perfect NIZK with Adaptive Soundness
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
Masayuki Abe, Serge Fehr
CHES
2004
Springer
136views Cryptology» more  CHES 2004»
15 years 3 months ago
Attacking DSA Under a Repeated Bits Assumption
We discuss how to recover the private key for DSA style signature schemes if partial information about the ephemeral keys is revealed. The partial information we examine is of a se...
Peter J. Leadbitter, Dan Page, Nigel P. Smart
EUROCRYPT
2003
Springer
15 years 2 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast