%0 Conference Paper %1 conf/indocrypt/MontreuilP04 %A Montreuil, Audrey %A Patarin, Jacques %B INDOCRYPT %D 2004 %E Canteaut, Anne %E Viswanathan, Kapalee %I Springer %K dblp %P 33-47 %T The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations. %U http://dblp.uni-trier.de/db/conf/indocrypt/indocrypt2004.html#MontreuilP04 %V 3348 %@ 3-540-24130-2

@inproceedings{conf/indocrypt/MontreuilP04, added-at = {2017-05-19T00:00:00.000+0200}, author = {Montreuil, Audrey and Patarin, Jacques}, biburl = {https://www.bibsonomy.org/bibtex/2c95017be69e913d26cb6378bc937d214/dblp}, booktitle = {INDOCRYPT}, crossref = {conf/indocrypt/2004}, editor = {Canteaut, Anne and Viswanathan, Kapalee}, ee = {https://doi.org/10.1007/978-3-540-30556-9_4}, interhash = {7afc7b283252c9a8d13c8300b2c01ee4}, intrahash = {c95017be69e913d26cb6378bc937d214}, isbn = {3-540-24130-2}, keywords = {dblp}, pages = {33-47}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T17:54:03.000+0200}, title = {The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations.}, url = {http://dblp.uni-trier.de/db/conf/indocrypt/indocrypt2004.html#MontreuilP04}, volume = 3348, year = 2004 }