ETH Zürich » Computer Science » Theory » Cryptography

Miscellaneous

Publications Concerning This Topic

Juan Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas
Rational Protocol Design: Cryptography Against Incentive-driven Adversaries
FOCS 2013, IEEE, Oct 2013.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Peter Gaži, Martin Hirt, and Ueli Maurer
Resource-Restricted Indifferentiability
Advances in Cryptology — EUROCRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7881, pp. 665–684, May 2013, this is the full version.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Jonathan Katz, Serge Fehr, Fang Song, Hong-Sheng Zhou, and Vassilis Zikas
Feasibility and Completeness of Cryptographic Tasks in the Quantum World
Theory of Cryptography Conference — TCC 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7785, pp. 281-296, Mar 2013.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Björn Tackmann
Synchrony Amplification
Information Theory Proceedings — ISIT 2012, IEEE, pp. 1583-1587, Jul 2012.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ghassan O. Karame, Srdjan Capkun, and Ueli Maurer
Privacy-Preserving Outsourcing of Brute-Force Key Searches
Proc. 2011 ACM Cloud Computing Security Workshop (CCSW), ACM, Oct 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Sandro Coretti, Esther Hänggi, and Stefan Wolf
Nonlocality is Transitive
Phys. Rev. Lett., American Physical Society, vol. 107, pp. 100402, Aug 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Pavel Raykov, Nicolas Schiper, and Fernando Pedone
Byzantine Fault-Tolerance with Commutative Commands
Principles of Distributed Systems, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, vol. 7109, pp. 329–342, 2011, 10.1007/978-3-642-25873-2_23.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Michael Backes, Aniket Kate, Arpita Patra
Computational Verifiable Secret Sharing Revisited
ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 7073, pp. 590-609, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Vishwambhar Rathi, and Lars K. Rasmussen
Optimality of LDGM-LDPC Compound Codes for Lossy Compression of Binary Erasure Source
Proceedings of the International Symposium on Information Theory and its Applications, Oct 2010.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Vishwambhar Rathi, and Lars K. Rasmussen
Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes
Proceedings of the Data Compression Conference, IEEE Computer Society, Mar 2010.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig, Ueli Maurer, and Stefano Tessaro
Abstract Storage Devices
Theory and Practice of Computer Science — SOFSEM 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5404, pp. 341–352, Jan 2009.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner
Symmetry of large physical systems implies independence of subsystems
Nature Physics, vol. 3, pp. 645 - 649, Jul 2007, Preliminary version is available at http://arxiv.org/abs/quant-ph/0703069.
Available files: [ Abstract ] [ BibTeX ]
Krzysztof Pietrzak and Douglas Wikström
Parallel Repetition of Computationally Sound Protocols Revisited
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 86–102, 2007.
Available files: [ Abstract ] [ BibTeX ]
Divesh Aggarwal, Chandan Dubey, and Shashank Mehta
Algorithms on Graphs with Small Dominating Targets.
Algorithms and Computation, 17th International Symposium, ISAAC 2006, Lecture Notes in Computer Science, Springer, vol. 4288, pp. 141-152, Dec 2006.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Yevgeniy Dodis and Renato Renner
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer
Automata, Languages and Programming — ICALP 2006, Springer-Verlag, pp. 204–215, Jul 2006, Available at http://arxiv.org/abs/quant-ph/0612012.
Available files: [ Abstract ] [ BibTeX ]
Renato Renner, Stefan Wolf, and J{ü}rg Wullschleger
The single-serving channel capacity
IEEE International Symposium on Information Theory — ISIT 2006, IEEE, Jul 2006, Available at http://arxiv.org/abs/cs.IT/0608018.
Available files: [ Abstract ] [ BibTeX ]
Dominik Raub and Rainer Steinwandt
An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction
Emerging Trends in Information and Communication Security — ETRICS 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3995, pp. 130–144, Jun 2006.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Christandl, Robert Koenig, Graeme Mitchison, and Renato Renner
One-and-a-half quantum de {F}inetti theorems
Feb 2006, Available at http://arxiv.org/abs/quant-ph/0602130.
Available files: [ Abstract ] [ BibTeX ]
Robert Koenig and Renato Renner
A de {F}inetti Representation for Finite Symmetric Quantum States
Journal of Mathematical Physics, vol. 46, no. 122108, Dec 2005, See also http://arxiv.org/abs/quant-ph/0410229.
Available files: [ Abstract ] [ BibTeX ]
Divesh Aggarwal, Shashank Mehta, and Jitender Deogun
Domination Search on Graphs with Low Dominating-Target-Number
Graph-Theoretic Concepts in Computer Science, WG 2005, Lecture Notes in Computer Science, Springer, vol. 3787, pp. 28-37, Jun 2005.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Abraham D. Flaxman and Bartosz Przydatek
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
Proc. 22nd Symposium on Theoretical Aspects of Computer Science — STACS 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3404, pp. 305–314, Feb 2005.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Smooth {R}enyi Entropy and Applications
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 233, Jun 2004.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig and Ueli Maurer
Extracting Randomness from Generalized Symbol-Fixing and Markov Sources
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 232, Jun 2004.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Quantum Pseudo-Telepathy and the {K}ochen-{S}pecker Theorem
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 322, Jun 2004, This is the Proceedings version of [RW04d].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer, Renato Renner, and Clemens Holenstein
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
Theory of Cryptography Conference — TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 21–39, Feb 2004.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Quantum Pseudo-Telepathy and the {K}ochen-{S}pecker Theorem
2004, Proceedings version (ISIT 2004): [RW04c].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein and Renato Renner
On the Frequency Distribution of Non-Independent Random Values
Nov 2003, Manuscript.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner
On the Variational Distance of Independently Repeated Experiments
eprint archive: http://arxiv.org/abs/cs.IT/0509013, Nov 2003, Manuscript.
Available files: [ Abstract ] [ BibTeX ]
Krzysztof Pietrzak
On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems
Journal of Computer and System Sciences, vol. 67, no. 1, pp. 757–771, Aug 2003.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Towards Characterizing the Non-Locality of Entangled Quantum States
IEEE International Symposium on Information Theory — ISIT 2003, IEEE, pp. 428, Jun 2003, This is the proceedings version of [RW02c], eprint archive: http://arxiv.org/abs/quant-ph/0211019.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Bartosz Przydatek
A Fast Approximation Algorithm for the Subset-Sum Problem
International Transactions in Operational Research, Blackwell Publishers, vol. 9, no. 4, pp. 437–459, Aug 2002, A preliminary version of this paper was presented at IFORS '99, 15th Triennial Conference of IFORS.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Ueli Maurer
About the Mutual (Conditional) Information
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 364, Jun 2002, This is the Proceedings version of [RM02a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Renato Renner
Generalized Indistinguishability
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 295, Jun 2002.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Ueli Maurer
About the Mutual (Conditional) Information
2002, Proceedings version (ISIT 2002): [RM02b].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Towards Characterizing the Non-Locality of Entangled Quantum States
eprint archive: http://arxiv.org/abs/quant-ph/0211019, 2002, Proceedings version (ISIT 2003): [RW03c].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Dziembowski, Marcin Jurdzinski, and Igor Walukiewicz
How Much Memory is Needed to Win Infinite Games?
12th Annual IEEE Symposium on Logic in Computer Science — LICS '97, IEEE, pp. 99–110, Jun 1997.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Markus Stadler
Cryptographic Protocols for Revocable Privacy
PhD Thesis, {ETH Zurich}, 1996.
Available files: [ Abstract ] [ BibTeX ]
Ueli Maurer
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de {B}ruijn-Good Graphs
Discrete Applied Mathematics, vol. 37, pp. 421–436, Jul 1992.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]

© IACR | Springer | ACM | IEEE


Main Research Page