Search

Your search keyword '"Maurer, Ueli"' showing total 865 results
Start Over Author "Maurer, Ueli"

Refine your results

more »

more »

more »

more »
865 results on '"Maurer, Ueli"'

1. Anamorphic Encryption, Revisited

Author

Banfi, Fabio, Gegier, Konstantin, Hirt, Martin, Maurer, Ueli, Rito, Guilherme, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Joye, Marc, editor, and Leander, Gregor, editor

Published
2024
Full Text
View/download PDF

3. Effects of Quantization on the Multiple-Round Secret-Key Capacity

Author

Günlü, Onur, Maurer, Ueli, and Ribeiro, João

Subjects
Computer Science - Information Theory, Computer Science - Cryptography and Security, Electrical Engineering and Systems Science - Signal Processing, Mathematics - Probability
Abstract

We consider the strong secret key (SK) agreement problem for the satellite communication setting, where a satellite chooses a common binary phase shift keying modulated input for three statistically independent additive white Gaussian noise measurement channels whose outputs are observed by two legitimate transceivers (Alice and Bob) and an eavesdropper (Eve), respectively. Legitimate transceivers have access to an authenticated, noiseless, two-way, and public communication link, so they can exchange multiple rounds of public messages to agree on a SK hidden from Eve. Without loss of essential generality, the noise variances for Alice's and Bob's measurement channels are both fixed to a value $Q>1$, whereas the noise over Eve's measurement channel has a unit variance, so $Q$ represents a channel quality ratio. We show that when both legitimate transceivers apply a one-bit uniform quantizer to their noisy observations before SK agreement, the SK capacity decreases at least quadratically in $Q$.

Published
2021

4. Deniable Authentication When Signing Keys Leak

Author

Chakraborty, Suvradip, Hofheinz, Dennis, Maurer, Ueli, Rito, Guilherme, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hazay, Carmit, editor, and Stam, Martijn, editor

Published
2023
Full Text
View/download PDF

5. Composable and Finite Computational Security of Quantum Message Transmission

Author

Banfi, Fabio, Maurer, Ueli, Portmann, Christopher, and Zhu, Jiamin

Subjects
Quantum Physics, Computer Science - Cryptography and Security
Abstract

Recent research in quantum cryptography has led to the development of schemes that encrypt and authenticate quantum messages with computational security. The security definitions used so far in the literature are asymptotic, game-based, and not known to be composable. We show how to define finite, composable, computational security for secure quantum message transmission. The new definitions do not involve any games or oracles, they are directly operational: a scheme is secure if it transforms an insecure channel and a shared key into an ideal secure channel from Alice to Bob, i.e., one which only allows Eve to block messages and learn their size, but not change them or read them. By modifying the ideal channel to provide Eve with more or less capabilities, one gets an array of different security notions. By design these transformations are composable, resulting in composable security. Crucially, the new definitions are finite. Security does not rely on the asymptotic hardness of a computational problem. Instead, one proves a finite reduction: if an adversary can distinguish the constructed (real) channel from the ideal one (for some fixed security parameters), then she can solve a finite instance of some computational problem. Such a finite statement is needed to make security claims about concrete implementations. We then prove that (slightly modified versions of) protocols proposed in the literature satisfy these composable definitions. And finally, we study the relations between some game-based definitions and our composable ones. In particular, we look at notions of quantum authenticated encryption and QCCA2, and show that they suffer from the same issues as their classical counterparts: they exclude certain protocols which are arguably secure., Comment: 43+11 pages, 18 figures, v2: minor changes, extended version of the published paper

Published
2019
Full Text
View/download PDF

7. Practical Provably Secure Flooding for Blockchains

Author

Liu-Zhang, Chen-Da, Matt, Christian, Maurer, Ueli, Rito, Guilherme, Thomsen, Søren Eller, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Agrawal, Shweta, editor, and Lin, Dongdai, editor

Published
2022
Full Text
View/download PDF

8. Anonymous Authenticated Communication

Author

Banfi, Fabio, Maurer, Ueli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Galdi, Clemente, editor, and Jarecki, Stanislaw, editor

Published
2022
Full Text
View/download PDF

9. Multi-Designated Receiver Signed Public Key Encryption

Author

Maurer, Ueli, Portmann, Christopher, Rito, Guilherme, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Dunkelman, Orr, editor, and Dziembowski, Stefan, editor

Published
2022
Full Text
View/download PDF

10. Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework)

Author

Maurer, Ueli, Portmann, Christopher, Rito, Guilherme, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Tibouchi, Mehdi, editor, and Wang, Huaxiong, editor

Published
2021
Full Text
View/download PDF

11. Direct Product Hardness Amplification

Author

Lanzenberger, David, Maurer, Ueli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Nissim, Kobbi, editor, and Waters, Brent, editor

Published
2021
Full Text
View/download PDF

12. Adaptive Security of Multi-party Protocols, Revisited

Author

Hirt, Martin, Liu-Zhang, Chen-Da, Maurer, Ueli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Nissim, Kobbi, editor, and Waters, Brent, editor

Published
2021
Full Text
View/download PDF

13. Generalized Proofs of Knowledge with Fully Dynamic Setup

Author

Badertscher, Christian, Jost, Daniel, Maurer, Ueli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Nissim, Kobbi, editor, and Waters, Brent, editor

Published
2021
Full Text
View/download PDF

14. Revisiting (R)CCA Security and Replay Protection

Author

Badertscher, Christian, Maurer, Ueli, Portmann, Christopher, Rito, Guilherme, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Garay, Juan A., editor

Published
2021
Full Text
View/download PDF

15. MPC with Synchronous Security and Asynchronous Responsiveness

Author

Liu-Zhang, Chen-Da, Loss, Julian, Maurer, Ueli, Moran, Tal, Tschudi, Daniel, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Moriai, Shiho, editor, and Wang, Huaxiong, editor

Published
2020
Full Text
View/download PDF

16. Coupling of Random Systems

Author

Lanzenberger, David, Maurer, Ueli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Pass, Rafael, editor, and Pietrzak, Krzysztof, editor

Published
2020
Full Text
View/download PDF

17. Synchronous Constructive Cryptography

Author

Liu-Zhang, Chen-Da, Maurer, Ueli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Pass, Rafael, editor, and Pietrzak, Krzysztof, editor

Published
2020
Full Text
View/download PDF

18. Anonymous Symmetric-Key Communication

Author

Banfi, Fabio, Maurer, Ueli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Galdi, Clemente, editor, and Kolesnikov, Vladimir, editor

Published
2020
Full Text
View/download PDF

20. Topology-Hiding Computation for Networks with Unknown Delays

Author

LaVigne, Rio, Liu-Zhang, Chen-Da, Maurer, Ueli, Moran, Tal, Mularczyk, Marta, Tschudi, Daniel, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Kiayias, Aggelos, editor, Kohlweiss, Markulf, editor, Wallden, Petros, editor, and Zikas, Vassilis, editor

Published
2020
Full Text
View/download PDF

21. Toward an Algebraic Theory of Systems

Author

Matt, Christian, Maurer, Ueli, Portmann, Christopher, Renner, Renato, and Tackmann, Björn

Subjects
Computer Science - Other Computer Science
Abstract

We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is irrelevant, a generalized form of associativity. Composition-order invariance explicitly captures a common property that is implicit in any context where one can draw a figure (hiding the drawing order) of several connected systems, which appears in many scientific contexts. This abstract algebra captures settings where one is interested in the behavior of a composed system in an environment and wants to abstract away anything internal not relevant for the behavior. This may include physical systems, electronic circuits, or interacting distributed systems. One specific such setting, of special interest in computer science, are functional system algebras, which capture, in the most general sense, any type of system that takes inputs and produces outputs depending on the inputs, and where the output of a system can be the input to another system. The behavior of such a system is uniquely determined by the function mapping inputs to outputs. We consider several instantiations of this very general concept. In particular, we show that Kahn networks form a functional system algebra and prove their composition-order invariance. Moreover, we define a functional system algebra of causal systems, characterized by the property that inputs can only influence future outputs, where an abstract partial order relation captures the notion of "later". This system algebra is also shown to be composition-order invariant and appropriate instantiations thereof allow to model and analyze systems that depend on time.

Published
2016
Full Text
View/download PDF

24. Causal Boxes: Quantum Information-Processing Systems Closed under Composition

Author

Portmann, Christopher, Matt, Christian, Maurer, Ueli, Renner, Renato, and Tackmann, Björn

Subjects
Quantum Physics, Computer Science - Cryptography and Security
Abstract

Complex information-processing systems, for example quantum circuits, cryptographic protocols, or multi-player games, are naturally described as networks composed of more basic information-processing systems. A modular analysis of such systems requires a mathematical model of systems that is closed under composition, i.e., a network of these objects is again an object of the same type. We propose such a model and call the corresponding systems causal boxes. Causal boxes capture superpositions of causal structures, e.g., messages sent by a causal box A can be in a superposition of different orders or in a superposition of being sent to box B and box C. Furthermore, causal boxes can model systems whose behavior depends on time. By instantiating the Abstract Cryptography framework with causal boxes, we obtain the first composable security framework that can handle arbitrary quantum protocols and relativistic protocols., Comment: 44+24 pages, 16 figures. v3: minor edits based on referee comments, matches published version up to layout. v2: definition of causality weakened, new references

Published
2015
Full Text
View/download PDF

25. A Unified and Composable Take on Ratcheting

Author

Jost, Daniel, Maurer, Ueli, Mularczyk, Marta, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hofheinz, Dennis, editor, and Rosen, Alon, editor

Published
2019
Full Text
View/download PDF

26. Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging

Author

Jost, Daniel, Maurer, Ueli, Mularczyk, Marta, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Ishai, Yuval, editor, and Rijmen, Vincent, editor

Published
2019
Full Text
View/download PDF

28. Security Definitions for Hash Functions: Combining UCE and Indifferentiability

Author

Jost, Daniel, Maurer, Ueli, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Catalano, Dario, editor, and De Prisco, Roberto, editor

Published
2018
Full Text
View/download PDF

29. A Constructive Perspective on Signcryption Security

Author

Badertscher, Christian, Banfi, Fabio, Maurer, Ueli, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Catalano, Dario, editor, and De Prisco, Roberto, editor

Published
2018
Full Text
View/download PDF

30. But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin

Author

Badertscher, Christian, Garay, Juan, Maurer, Ueli, Tschudi, Daniel, Zikas, Vassilis, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Nielsen, Jesper Buus, editor, and Rijmen, Vincent, editor

Published
2018
Full Text
View/download PDF

31. Composable and Robust Outsourced Storage

Author

Badertscher, Christian, Maurer, Ueli, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, and Smart, Nigel P., editor

Published
2018
Full Text
View/download PDF

32. On Composable Security for Digital Signatures

Author

Badertscher, Christian, Maurer, Ueli, Tackmann, Björn, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Abdalla, Michel, editor, and Dahab, Ricardo, editor

Published
2018
Full Text
View/download PDF

33. Topology-Hiding Computation Beyond Semi-Honest Adversaries

Author

LaVigne, Rio, Liu-Zhang, Chen-Da, Maurer, Ueli, Moran, Tal, Mularczyk, Marta, Tschudi, Daniel, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Beimel, Amos, editor, and Dziembowski, Stefan, editor

Published
2018
Full Text
View/download PDF

34. Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio

Author

Jost, Daniel, Maurer, Ueli, Ribeiro, João L., Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Beimel, Amos, editor, and Dziembowski, Stefan, editor

Published
2018
Full Text
View/download PDF

43. Abstract Storage Devices

Author

Koenig, Robert, Maurer, Ueli, and Tessaro, Stefano

Subjects
Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Computer Science - Information Theory
Abstract

A quantum storage device differs radically from a conventional physical storage device. Its state can be set to any value in a certain (infinite) state space, but in general every possible read operation yields only partial information about the stored state. The purpose of this paper is to initiate the study of a combinatorial abstraction, called abstract storage device (ASD), which models deterministic storage devices with the property that only partial information about the state can be read, but that there is a degree of freedom as to which partial information should be retrieved. This concept leads to a number of interesting problems which we address, like the reduction of one device to another device, the equivalence of devices, direct products of devices, as well as the factorization of a device into primitive devices. We prove that every ASD has an equivalent ASD with minimal number of states and of possible read operations. Also, we prove that the reducibility problem for ASD's is NP-complete, that the equivalence problem is at least as hard as the graph isomorphism problem, and that the factorization into binary-output devices (if it exists) is unique., Comment: 20 pages

Published
2007

44. Strengthening Access Control Encryption

Author

Badertscher, Christian, Matt, Christian, Maurer, Ueli, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Takagi, Tsuyoshi, editor, and Peyrin, Thomas, editor

Published
2017
Full Text
View/download PDF

45. Per-Session Security: Password-Based Cryptography Revisited

Author

Demay, Grégory, Gaži, Peter, Maurer, Ueli, Tackmann, Björn, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Foley, Simon N., editor, Gollmann, Dieter, editor, and Snekkenes, Einar, editor

Published
2017
Full Text
View/download PDF

46. Bitcoin as a Transaction Ledger: A Composable Treatment

Author

Badertscher, Christian, Maurer, Ueli, Tschudi, Daniel, Zikas, Vassilis, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Katz, Jonathan, editor, and Shacham, Hovav, editor

Published
2017
Full Text
View/download PDF

47. Locking of accessible information and implications for the security of quantum cryptography

Author

Koenig, Robert, Renner, Renato, Bariska, Andor, and Maurer, Ueli

Subjects
Quantum Physics
Abstract

The unconditional security of a quantum key distribution protocol is often defined in terms of the accessible information, that is, the maximum mutual information between the distributed key S and the outcome of an optimal measurement on the adversary's (quantum) system. We show that, even if this quantity is small, certain parts of the key S might still be completely insecure when S is used in applications, such as for one-time pad encryption. This flaw is due to a locking property of the accessible information: one additional (physical) bit of information might increase the accessible information by more than one bit., Comment: 5 pages; minor changes

Published
2005
Full Text
View/download PDF

48. On the Power of Quantum Memory

Author

Koenig, Robert, Maurer, Ueli, and Renner, Renato

Subjects
Quantum Physics
Abstract

We address the question whether quantum memory is more powerful than classical memory. In particular, we consider a setting where information about a random n-bit string X is stored in r classical or quantum bits, for r

Published
2003
Full Text
View/download PDF

49. A Quantum solution to the Byzantine agreement problem

Author

Fitzi, Matthias, Gisin, Nicolas, and Maurer, Ueli

Subjects
Quantum Physics
Abstract

We present a solution to an old and timely problem in distributed computing. Like Quantum Key Distribution (QKD), quantum channels make it possible to achieve taks classically impossible. However, unlike QKD, here the goal is not secrecy but agreement, and the adversary is not outside but inside the game, and the resources require qutrits., Comment: 4 pages, 1 figure

Published
2001
Full Text
View/download PDF

50. From Indifferentiability to Constructive Cryptography (and Back)

Author

Maurer, Ueli, Renner, Renato, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Hirt, Martin, editor, and Smith, Adam, editor

Published
2016
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results