Sciweavers

406 search results - page 37 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
DATE
2008
IEEE
85views Hardware» more  DATE 2008»
14 years 5 months ago
Improved Visibility in One-to-Many Trace Concretization
We present an improved algorithm for concretization of abstract eres in abstraction refinement-based invariant checking. The algorithm maps each transition of the abstract error ...
Kuntal Nanshi, Fabio Somenzi
EUROCRYPT
2004
Springer
14 years 4 months ago
Black-Box Composition Does Not Imply Adaptive Security
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
Steven Myers
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
14 years 3 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
Yehuda Lindell
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 11 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
INFORMATICALT
2008
93views more  INFORMATICALT 2008»
13 years 11 months ago
Robust Watermarking based on Subsampling and Nonnegative Matrix Factorization
Abstract. This paper presents a novel robust digital image watermarking scheme using subsampling and nonnegative matrix factorization. Firstly, subsampling is used to construct a s...
Wei Lu, Hongtao Lu