C. Cr'epeau, "Efficient cryptographic protocols based on noisy channels." Proceedings of EUROCRYPT '97, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Oblivious Transfer with a Memory-Bounded Receiver - Cachin, Crepeau, Marcil (1998) (14 citations) Self-citation (Crepeau) (Correct)
....functions. However, if Alice and Bob have access to a quantum channel, oblivious transfer can be reduced to a weaker primitive known as bit commitment [4, 12] and thus is secure assuming only a one way function in the quantum computer model. Oblivious transfer can also be based on a noisy channel [15, 14]. In this paper we describe how a bound on memory size of the receiver Bob can be used to implement oblivious transfer. We assume that there is an initial broadcast of a huge amount of random data, during which Bob is free to compute any probabilistic function with unlimited power. As long as the ....
C. Crepeau. Efficient cryptographic protocols based on noisy channels. In W. Fumy, editor, Advances in Cryptology: EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 306--317. Springer, 1997.
Oblivious Transfer with a Memory-Bounded Receiver - Cachin, Crepeau, Marcil (1998) (14 citations) Self-citation (Crepeau) (Correct)
....access to a quantum channel, Oblivious Transfer can be reduced to a weaker primitive known as Bit Commitment [BBCS92, Cre84] and thus is secure assuming only a one way function in the quantum computer model. Oblivious transfer can also be based on a noisy channel, as shown by Crepeau and Kilian [CK88, Cre97]. In this paper we describe how a bound on memory size of the receiver Bob can be used to implement oblivious transfer. We assume that there is an initial broadcast of a huge amount of random data, during which Bob is free to compute any probabilistic function with unlimited power. As long as the ....
Claude Crepeau, Efficient cryptographic protocols based on noisy channels, Advances in Cryptology: EUROCRYPT '97 (Walter Fumy, ed.), Lecture Notes in Computer Science, vol. 1233, Springer, 1997, pp. 306--317.
Oblivious Transfer with a Memory-Bounded Receiver - Cachin, Crepeau, Marcil (1998) (14 citations) Self-citation (Crepeau) (Correct)
....access to a quantum channel, Oblivious Transfer can be reduced to a weaker primitive known as Bit Commitment [BBCS92, Cre84] and thus is secure assuming only a one way function in the quantum computer model. Oblivious transfer can also be based on a noisy channel, as shown by Crepeau and Kilian [CK88, Cre97]. In this paper we describe how a bound on memory size of the receiver Bob can be used to implement oblivious transfer. We assume that there is an initial broadcast of a huge amount of random data, during which Bob is free to compute any probabilistic function with unlimited power. As long as the ....
Claude Crepeau, Efficient cryptographic protocols based on noisy channels, Advances in Cryptology: EUROCRYPT '97 (Walter Fumy, ed.), Lecture Notes in Computer Science, vol. 1233, Springer, 1997, pp. 306--317.
Oblivious Transfer with a Memory-Bounded Receiver - Cachin, Crepeau, Marcil (1998) (14 citations) Self-citation (Crepeau) (Correct)
....functions. However, if Alice and Bob have access to a quantum channel, oblivious transfer can be reduced to a weaker primitive known as bit commitment [4, 12] and thus is secure assuming only a one way function in the quantum computer model. Oblivious transfer can also be based on a noisy channel [15, 14]. In this paper we describe how a bound on memory size of the receiver Bob can be used to implement oblivious transfer. We assume that there is an initial broadcast of a huge amount of random data, during which Bob is free to compute any probabilistic function with unlimited power. As long as the ....
C. Crepeau. Efficient cryptographic protocols based on noisy channels. In W. Fumy, editor, Advances in Cryptology: EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 306--317. Springer, 1997.
Smooth Entropy and R'enyi Entropy - Christian Cachin Department (1997) (2 citations) (Correct)
No context found.
C. Cr'epeau, "Efficient cryptographic protocols based on noisy channels." Proceedings of EUROCRYPT '97, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC