Data-independent sequencing with the timing object

Arntzen, Ingar M.; Borch, Njål T.

doi:10.1145/2910017.2910614

Cited by 4 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, in the program if(c){h ← h + 1}, if h is secret, ConTExT and SpectreGuard would stall the instruction h ← h + 1 until speculations are resolved, whereas PROSPECT would allow h ← h + 1 to speculatively execute. Given a whitelist of secure instructions (e.g., [102]), ConTExT and SpectreGuard could adopt this less conservative approach while still being secure. Finally, contrary to ConTExT and SpectreGuard, our work addresses load value speculation and shows that correct predictions must sometimes be rolled back for security.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

ProSpeCT: Provably Secure Speculation for the Constant-Time Policy (Extended version)

Daniel¹,

Bognar²,

Noorman³

et al. 2023

Preprint

View full text Add to dashboard Cite

We propose PROSPECT, a generic formal processor model providing provably secure speculation for the constant-time policy. For constant-time programs under a non-speculative semantics, PROSPECT guarantees that speculative and out-oforder execution cause no microarchitectural leaks. This guarantee is achieved by tracking secrets in the processor pipeline and ensuring that they do not influence the microarchitectural state during speculative execution. Our formalization covers a broad class of speculation mechanisms, generalizing prior work. As a result, our security proof covers all known Spectre attacks, including load value injection (LVI) attacks.In addition to the formal model, we provide a prototype hardware implementation of PROSPECT on a RISC-V processor and show evidence of its low impact on hardware cost, performance, and required software changes. In particular, the experimental evaluation confirms our expectation that for a compliant constant-time binary, enabling ProSpeCT incurs no performance overhead.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

ProSpeCT: Provably Secure Speculation for the Constant-Time Policy (Extended version)

Daniel¹,

Bognar²,

Noorman³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Although the internal clock of most devices connected to the Internet are synchronized by using the Network Time Protocol (NTP), accurate clock synchronization cannot be guaranteed due to clock drift or a firewall blocking the service. Arntzen and Borch propose a new programming model for precisely timed Web applications [19]. Timing objects located at the clients are synchronized with a timing object hosted online by a Fig.…”

Section: A Clock Synchronizationmentioning

confidence: 99%

“…Experiments show that the novel hybrid approach can reduce synchronization time with 19.4% compared to standard adaptive streaming over HTTP/1.1 when bandwidth is limited to 2.5 Mb/s and an RTT of 150 ms. The gain increases even more when a higher throughput is available.…”

mentioning

confidence: 99%

A Web-based framework for fast synchronization of live video players

Pauwels

Hooft

Petrangeli

et al. 2017

2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM)

View full text Add to dashboard Cite

Abstract-The increased popularity of social media and mobile devices has radically changed the way people consume multimedia content online. As an example, users can experience the same event (e.g. a sports event or a concert) together using social media, even if they are not in the same physical location. Moreover, the introduction of the HTTP Adaptive Streaming principle has made it possible to deliver video over the best-effort Internet with consistent quality, even for mobile devices. One of the challenges within this context is the synchronization of multimedia playback among geographically distributed clients. To solve this issue, we propose a Web-based framework which allows to synchronize the playback of different clients. We also present a novel hybrid approach for adaptive streaming to allow fast synchronization among different clients, which relies on HTTP/2's server push feature in combination with sub-second video segments.In this paper, we detail the proposed framework and provide a comprehensive analysis of its performance. Experiments show that the novel hybrid approach can reduce synchronization time with 19.4% compared to standard adaptive streaming over HTTP/1.1 when bandwidth is limited to 2.5 Mb/s and an RTT of 150 ms. The gain increases even more when a higher throughput is available. The obtained results entail that the proposed framework can provide quality of experience for all users watching online video together.

show abstract