Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols. Bacelar Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., & Zanella Béguelin, S. In Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12, pages 488, Raleigh, North Carolina, USA, 2012. ACM Press.
Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols [link]Paper  doi  abstract   bibtex   
Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently.
@inproceedings{bacelaralmeidaFullProofCryptography2012,
	address = {Raleigh, North Carolina, USA},
	title = {Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols},
	isbn = {978-1-4503-1651-4},
	shorttitle = {Full proof cryptography},
	url = {http://dl.acm.org/citation.cfm?doid=2382196.2382249},
	doi = {10.1145/2382196.2382249},
	abstract = {Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently.},
	language = {en},
	urldate = {2021-08-03},
	booktitle = {Proceedings of the 2012 {ACM} conference on {Computer} and communications security - {CCS} '12},
	publisher = {ACM Press},
	author = {Bacelar Almeida, José and Barbosa, Manuel and Bangerter, Endre and Barthe, Gilles and Krenn, Stephan and Zanella Béguelin, Santiago},
	year = {2012},
	pages = {488},
}

Downloads: 0