Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Jesper Buus Nielsen:

TR18-109 | 29th May 2018
Kasper Green Larsen, Jesper Buus Nielsen

Yes, There is an Oblivious RAM Lower Bound!

An Oblivious RAM (ORAM) introduced by Goldreich and Ostrovsky
[JACM'96] is a (possibly randomized) RAM, for which the memory access
pattern reveals no information about the operations
performed. The main performance metric of an ORAM is the bandwidth
overhead, i.e., the multiplicative factor extra memory blocks that must be
accessed ... more >>>

TR17-078 | 21st April 2017
Nico Döttling, Jesper Buus Nielsen, Maceij Obremski

Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model

Revisions: 1

We present an information-theoretically secure continuously non-malleable code in the constant split-state model, where there is a self-destruct mechanism which ensures that the adversary loses access to tampering after the first failed decoding. Prior to our result only codes with computational security were known for this model, and it has ... more >>>

TR05-162 | 23rd December 2005
Yunlei Zhao, Jesper Buus Nielsen, Robert H. Deng, Feng Dengguo

Generic yet Practical ZK Arguments from any Public-Coin HVZK

Revisions: 1

In this work, we present a generic yet practical transformation from any public-coin honest-verifier zero-knowledge (HVZK) protocols to normal zero-knowledge (ZK) arguments. By ``generic", we mean that the transformation is applicable to any public-coin HVZK protocol under any one-way function (OWF) admitting Sigma-protocols. By ``practical" we mean that the transformation ... more >>>

ISSN 1433-8092 | Imprint