Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Robin Künzler
@article{DBLP:journals/joc/CoronHKPST16, author = {Jean{-}S{\'{e}}bastien Coron and Thomas Holenstein and Robin K{\"{u}}nzler and Jacques Patarin and Yannick Seurin and Stefano Tessaro}, title = {How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction}, journal = {J. Cryptol.}, volume = {29}, number = {1}, pages = {61--114}, year = {2016}, url = {https://doi.org/10.1007/s00145-014-9189-6}, doi = {10.1007/S00145-014-9189-6}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/joc/CoronHKPST16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/HolensteinK14, author = {Thomas Holenstein and Robin K{\"{u}}nzler}, editor = {Zhipeng Cai and Alex Zelikovsky and Anu G. Bourgeois}, title = {A Protocol for Generating Random Elements with Their Probabilities}, booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON} 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8591}, pages = {191--202}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-08783-2\_17}, doi = {10.1007/978-3-319-08783-2\_17}, timestamp = {Thu, 20 Aug 2020 15:36:49 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/HolensteinK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/HolensteinK14a, author = {Thomas Holenstein and Robin K{\"{u}}nzler}, editor = {Zhipeng Cai and Alex Zelikovsky and Anu G. Bourgeois}, title = {A New View on Worst-Case to Average-Case Reductions for {NP} Problems}, booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON} 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8591}, pages = {203--214}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-08783-2\_18}, doi = {10.1007/978-3-319-08783-2\_18}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/HolensteinK14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HolensteinK13, author = {Thomas Holenstein and Robin K{\"{u}}nzler}, title = {A Protocol for Generating Random Elements with their Probabilities}, journal = {CoRR}, volume = {abs/1312.2483}, year = {2013}, url = {http://arxiv.org/abs/1312.2483}, eprinttype = {arXiv}, eprint = {1312.2483}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HolensteinK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HolensteinK13a, author = {Thomas Holenstein and Robin K{\"{u}}nzler}, title = {A New View on Worst-Case to Average-Case Reductions for {NP} Problems}, journal = {CoRR}, volume = {abs/1312.2490}, year = {2013}, url = {http://arxiv.org/abs/1312.2490}, eprinttype = {arXiv}, eprint = {1312.2490}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HolensteinK13a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HolensteinKT11, author = {Thomas Holenstein and Robin K{\"{u}}nzler and Stefano Tessaro}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {The equivalence of the random oracle model and the ideal cipher model, revisited}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {89--98}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993650}, doi = {10.1145/1993636.1993650}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HolensteinKT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1011-1264, author = {Thomas Holenstein and Robin K{\"{u}}nzler and Stefano Tessaro}, title = {Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited}, journal = {CoRR}, volume = {abs/1011.1264}, year = {2010}, url = {http://arxiv.org/abs/1011.1264}, eprinttype = {arXiv}, eprint = {1011.1264}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1011-1264.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/KunzlerMR09, author = {Robin K{\"{u}}nzler and J{\"{o}}rn M{\"{u}}ller{-}Quade and Dominik Raub}, editor = {Omer Reingold}, title = {Secure Computability of Functions in the {IT} Setting with Dishonest Majority and Applications to Long-Term Security}, booktitle = {Theory of Cryptography, 6th Theory of Cryptography Conference, {TCC} 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5444}, pages = {238--255}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-00457-5\_15}, doi = {10.1007/978-3-642-00457-5\_15}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/tcc/KunzlerMR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/KunzlerMR08, author = {Robin K{\"{u}}nzler and J{\"{o}}rn M{\"{u}}ller{-}Quade and Dominik Raub}, title = {Secure Computability of Functions in the {IT} setting with Dishonest Majority and Applications to Long-Term Security}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {264}, year = {2008}, url = {http://eprint.iacr.org/2008/264}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/KunzlerMR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.