@inproceedings {26353,
title = {Definitions for Plaintext-Existence Hiding in Cloud Storage},
journal = {Proceedings of the 13th International Conference on Availability, Reliability and Security},
year = {2018},
publisher = {ACM Press},
address = {New York, NY, USA},
abstract = {Cloud storage services use deduplication for saving bandwidth and storage. An adversary can exploit side-channel information in several attack scenarios when deduplication takes place at the client side, leaking information on whether a specific plaintext exists in the cloud storage. Generalising existing security definitions, we introduce formal security games for a number of possible adversaries in this domain, and show that games representing all natural adversarial behaviors are in fact equivalent. These results allow users and practitioners alike to accurately assess the vulnerability of deployed systems to this real-world concern.},
keywords = {Cloud based storage, information systems, security and privacy},
isbn = {9781450364485},
doi = {10.1145/323083310.1145/3230833.3234515},
url = {http://dl.acm.org/citation.cfm?doid=3230833http://dl.acm.org/citation.cfm?doid=3230833.3234515http://dl.acm.org/ft_gateway.cfm?id=3234515\&ftid=1993395\&dwn=1},
author = {Boyd, Colin and Gareth T. {Davies} and Gj{\o}steen, Kristian and Raddum, H{\r a}vard and Toorani, Mohsen}
}
@article {26355,
title = {Factorization using binary decision diagrams},
journal = {Cryptography and Communications},
volume = {11},
year = {2018},
month = {2018},
pages = {1-18},
publisher = { Springer},
abstract = {We address the factorization problem in this paper: Given an integer\ N=pq, find two factors\ p\ and\ q\ of\ N\ such that\ p\ and\ q\ are of same bit-size. When we say integer multiplication of\ N, we mean expressing\ N\ as a product of two factors\ p\ and\ q\ such that\ p\ and\ q\ are of\ same bit-size. We work on this problem in the light of Binary Decision Diagrams (BDD). A Binary Decision Diagram is an acyclic graph which can be used to represent Boolean functions. We represent integer multiplication of\ N\ as product of factors\ p\ and\ q\ using a BDD. Using various operations on the BDD we present an algorithm for factoring\ N. All calculations are done over\ GF(2). We show that the number of nodes in the constructed BDD is\ O(n3)\ where\ n\ is the number of bits in\ p\ or\ q. We do factoring experiments for the case when\ p\ and\ q\ are primes as in the case of RSA modulus\ N, and report on the observed complexity. The multiplication of large RSA numbers (that cannot be factored fast in practice) can still be easily represented as a BDD.},
keywords = {Binary decision diagrams, Integer factorization, RSA},
issn = {1936-2447},
doi = {10.1007/s12095-018-0304-7},
url = {https://link.springer.com/article/10.1007/s12095-018-0304-7},
author = {Raddum, H{\r a}vard and Varadharajan, Srimathi}
}
@inproceedings {26354,
title = {Security Notions for Cloud Storage and Deduplication},
journal = {ProvSec 2018: Provable Security},
number = {11192},
year = {2018},
pages = {347 - 365},
publisher = {Springer International Publishing},
address = {Switzerland},
abstract = {Cloud storage is in widespread use by individuals and enterprises but introduces a wide array of attack vectors. A basic step for users is to encrypt their data, yet it is not obvious what security properties are required for such encryption. Furthermore, cloud storage providers often use techniques such as data deduplication for improving efficiency which restricts the application of semantically-secure encryption. Generic security goals and attack models have thus far proved elusive: primitives are considered in isolation and protocols are often proved secure under ad hoc models for restricted classes of adversaries.We formally model natural security notions for cloud storage and deduplication using a generic syntax for storage systems. We define security notions for confidentiality and integrity in encrypted cloud storage and determine relations between these notions. We show how to build cloud storage systems that satisfy our defined security notions using standard cryptographic components.},
isbn = {978-3-030-01445-2},
issn = {0302-9743},
doi = {10.1007/978-3-030-01446-9_20},
url = {https://link.springer.com/chapter/10.1007/978-3-030-01446-9_20},
author = {Raddum, H{\r a}vard and Toorani, Mohsen and Gj{\o}steen, Kristian and Boyd, Colin and Gareth T. {Davies}},
editor = {Baek, J.}
}