Florian Kerschbaum, Axel Schröpfer. Optimal Average-Complexity Ideal-Security Order-Preserving Encryption. In Gail-Joon Ahn, Moti Yung, Ninghui Li, editors, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, November 3-7, 2014. pages 275-286, ACM, 2014. [doi]
@inproceedings{KerschbaumS14, title = {Optimal Average-Complexity Ideal-Security Order-Preserving Encryption}, author = {Florian Kerschbaum and Axel Schröpfer}, year = {2014}, doi = {10.1145/2660267.2660277}, url = {http://doi.acm.org/10.1145/2660267.2660277}, researchr = {https://researchr.org/publication/KerschbaumS14}, cites = {0}, citedby = {0}, pages = {275-286}, booktitle = {Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, November 3-7, 2014}, editor = {Gail-Joon Ahn and Moti Yung and Ninghui Li}, publisher = {ACM}, isbn = {978-1-4503-2957-6}, }