Sciweavers

73 search results - page 6 / 15
» The Strength of Multilinear Proofs
Sort
View
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
15 years 9 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
ESORICS
2012
Springer
13 years 2 months ago
X.509 Forensics: Detecting and Localising the SSL/TLS Men-in-the-Middle
Although recent compromises and admissions have given new credibility to claimed encounters of Man-in-the-middle (MitM) attacks on SSL/TLS, very little proof exists in the public r...
Ralph Holz, Thomas Riedmaier, Nils Kammenhuber, Ge...
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
14 years 11 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ACNS
2008
Springer
103views Cryptology» more  ACNS 2008»
15 years 6 months ago
PUF-HB: A Tamper-Resilient HB Based Authentication Protocol
We propose a light-weight protocol for authentication of low-power devices. Our construction PUF-HB merges the positive qualities of two families of authentication functions. PUF ...
Ghaith Hammouri, Berk Sunar
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
15 years 5 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste