Pseudorandom correlation functions (PCF), introduced in the work of (Boyle et al., FOCS 2020), allow two parties to locally generate, from short correlated keys, a near-unbounded amount pseudorandom samples target correlation. PCF is an extremely appealing primitive secure computation, where they confine all preprocessing phases future computations could want execute single interaction with low...

Using a recent improvement by Bettin and Chandee to a bound of Duke, Friedlander and Iwaniec (1997) on double exponential sums with Kloosterman fractions, we establish a uniformity of distribution result for the fractional parts of Dedekind sums s(m,n) with m and n running over rather general sets. Our result extends earlier work of Myerson (1988) and Vardi (1987). Using different techniques, w...

Design of Wireless Local Area Networks (WLANs) needs to take into consideration the limited bandwidth available in the ISM band along with the noisy characteristics of the wireless environment and hidden terminal effects. In this paper we propose an enhancement for IEEE 802.11 standard that improves the WLAN support for multimedia applications. In the IEEE 802.11 PCF polling based protocol desi...

The formulation of quantum dynamical time correlation functions is examined within the context of the path centroid variable in Feynman path integration. This study builds on the centroid-based approach to equilibrium properties developed in the companion paper. The introduction of the centroid perspective into the calculation of real time position correlation functions is outlined and an intri...

Side-channel attacks are a serious threat to securitycritical software. To mitigate remote timing and cachetiming attacks, many ubiquitous cryptography software libraries feature constant-time implementations of cryptographic primitives. In this work, we disclose a vulnerability in OpenSSL 1.0.1u that recovers ECDSA private keys for the standardized elliptic curve P-256 despite the library feat...