Sciweavers

903 search results - page 30 / 181
» On the reduction of a random basis
Sort
View
ICSE
2007
IEEE-ACM
16 years 2 months ago
Parallel Randomized State-Space Search
Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major advances in reduction and optimization techniques, s...
Matthew B. Dwyer, Sebastian G. Elbaum, Suzette Per...
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
15 years 3 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
MEDIAFORENSICS
2010
15 years 3 months ago
Multimodal object authentication with random projections: a worst-case approach
In this paper, we consider a forensic multimodal authentication framework based on binary hypothesis testing in random projections domain. We formulate a generic authentication pr...
Oleksiy J. Koval, Sviatoslav Voloshynovskiy
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 3 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
ICC
2008
IEEE
101views Communications» more  ICC 2008»
15 years 8 months ago
SINR Estimation in Random Beamforming with Noisy MIMO Channel Measurements
—An improved SINR metric is proposed for the random beamforming scheme introduced by Sharif and Hassibi, when the channel observation used to compute the SINR is known to be nois...
Roland Tresch, Maxime Guillaud