112
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
We present Onion ORAM, an Oblivious RAM (ORAM) with constant worst-case bandwidth blowup that leverages poly-logarithmic server computation to circumvent the logarithmic lower bou...
114
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
We initiate the study of cryptography for parallel RAM (PRAM) programs. The PRAM model captures modern multi-core architectures and cluster computing models, where several process...
130
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
In [CDS94] Cramer, Damg˚ard and Schoenmakers (CDS) devise an OR-composition technique for Σ-protocols that allows to construct highly-efficient proofs for compound statements. S...
120
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
We consider interactive proof systems over adversarial communication channels. We show that the seminal result that IP = PSPACE still holds when the communication channel is malic...