Sciweavers

117 search results - page 20 / 24
» On the power of quantum fingerprinting
Sort
View
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 9 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
ICCAD
2009
IEEE
121views Hardware» more  ICCAD 2009»
13 years 6 months ago
MOLES: Malicious off-chip leakage enabled by side-channels
Economic incentives have driven the semiconductor industry to separate design from fabrication in recent years. This trend leads to potential vulnerabilities from untrusted circui...
Lang Lin, Wayne Burleson, Christof Paar
STACS
2007
Springer
14 years 2 months 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
ITCC
2005
IEEE
14 years 2 months ago
Computing Molecular Potential Energy Surface with DIET
New developments in the field of theoretical chemistry require the computation of numerous Molecular Potential Energy Surfaces (PESs) to generate adequate quantum force field pa...
Emmanuel Jeannot, Gerald Monard
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
14 years 1 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker