2 Hits in 2.5 sec

Black-Box Garbled RAM

Sanjam Garg, Steve Lu, Rafail Ostrovsky
2015 2015 IEEE 56th Annual Symposium on Foundations of Computer Science  
Statistically-secure ORAM with (log2 n) overhead.  ...  statistical ORAM.  ... 
doi:10.1109/focs.2015.22 dblp:conf/focs/GargLO15 fatcat:7bwknym2nnhx5pitklb674b64q

Security and Privacy in Cloud Computing: Technical Review

Yunusa Simpa Abdulsalam, Mustapha Hedabou
2021 Future Internet  
This paper aims to introduce security and privacy issues that demand an adaptive solution approach without conflicting with existing or future cloud security.  ...  Unfortunately, the works provided in the literature lack the flexibility in mitigating multiple threats without conflicting with cloud security objectives.  ...  Further works by Stefanov et al. [82] achieved O(log2 N/ log χ), for large block size B = χlogN with a reduction rate of χ ≥ 2 for every N 0 = N/χ, where N represents  ... 
doi:10.3390/fi14010011 fatcat:rzfmwfbxujcu7ohcecbqsb6p2a