, Practical Private Information Retrieval from a Time-Varying, Multi-Attribute, and Multiple-Occurrence Database, Proc. of 28th DBSec Conference, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01284868
, Practical and Privacy-Preserving Policy Compliance for Outsourced Data, Proc. of 2nd WAHC Workshop, 2014.
DOI : 10.1007/978-3-662-44774-1_15
, Optimal Sizing of Records when Divided Messages Can Be Stored in Records of Different Sizes, Operations Research, vol.30, issue.1, pp.29-39, 1982.
DOI : 10.1287/opre.30.1.29
, Optimal Sizing of Records Used to Store Messages of Various Lengths, Management Science, vol.26, issue.8, pp.796-809, 1980.
DOI : 10.1287/mnsc.26.8.796
, How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority, Proc. of ACM STOC, vol.1987, pp.218-229
, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984.
DOI : 10.1016/0022-0000(84)90070-9
URL : http://doi.org/10.1016/0022-0000(84)90070-9
, Executing SQL over encrypted data in the database-service-provider model, Proc. of SIGMOD Conference, pp.216-227, 2002.
, An Extended Model for the Optimal Sizing of Records, Journal of the Operational Research Society, vol.34, issue.11, pp.1099-1105, 1983.
DOI : 10.1057/jors.1983.241
, Optimum Cell Size for the Storage of Messages, IEEE Transactions on Software Engineering, vol.7, issue.1, pp.132-134, 1981.
DOI : 10.1109/TSE.1981.230819
, A Fixed Optimum Cell-Size for Records of Various Lengths, Journal of the ACM, vol.12, issue.1, pp.53-70, 1965.
DOI : 10.1145/321250.321255
, How to generate and exchange secrets, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.162-167
DOI : 10.1109/SFCS.1986.25