Cryptography in the bounded quantum-storage model

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 449-458

  Damgård, Ivan B ^a,b   Fehr, Serge ^c   Salvail, Louis ^a,b   Schaffner, Christian ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b Foundations in Cyptography and Security ^*  (Denmark)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIT COMMITMENT; BOUNDED SIZE; CRYPTOGRAPHIC PRIMITIVES; QUANTUM MEMORY;

COMPUTATIONAL METHODS; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

QUANTUM CRYPTOGRAPHY;

EID: 33748633496     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.30     Document Type: Conference Paper

References (21)

1. C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, pages 175-179, 1984.
2. C. Cachin. C. Crépeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science - FOCS 1998, pages 493-502, 1998.
3. J. L. Carter and M. N. Wegman. Universal classes of hash functions. In Proceedings of the 9th ACM Symposium on Theory of Computing - STOC 1977, pages 106-112, 1977.
4. C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science - FOCS 1988, pages 42-53, 1988.
5. I. B. Damgård, S. Fehr, K. Morozov, and L. Salvail. Unfair noisy channels and oblivious transfer. In Theory of Cryptography -TCC 2004, pages 355-373, 2004.
6. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner. Cryptography in the bounded quantum-storage model. Research Series RS-05-20, BRICS. Department of Computer Science, University of Aarhus (www.brics.dk), 2005.
7. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner. 1-2 OT in the bounded quantum-storage model with applications. In preparation, 2005.
8. I. B. Damgård, J. Kilian, and L. Salvail. On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In Advances in Cryptology - EURO-CRYPT 1999, pages 56-73, 1999.
9. Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel. Constant-round oblivious transfer in the bounded storage model. In Theory of Cryptography - TCC 2004, pages 446-472, 2004.
10. Y. Dodis, L. Reyzin, and A. Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In Advances in Cryptology - EUROCRYPT 2004, pages 523-540, 2004.
11. P. Dumais, D. Mayers, and L. Salvail. Perfectly concealing quantum bit commitment from any quantum one-way permutation. In Advances in Cryptology - EUROCRYPT 2000, pages 300-315, 2000.
12. S. Dziembowski and U. M. Maurer. On generating the initial key in the bounded-storage model. In Advances in Cryptology - EUROCRYPT2004, pages 126-137, 2004.
13. C. A. Fuchs and J. van de Graaf. Cryptographic distinguishability measures for quantum-mechanical states. IEEE Transactions on Information Theory, 45(4):1216-1227, 1999.
14. H.-K. Lo and H. F. Chau. Is quantum bit commitment really possible? Physical Review Letters, 78:3410-3413, April 1997.
15. H. Maassen and J. B. M. Uffink. Generalized entropic uncertainty relations. Physical Review Letters, 60(12):1103-1106, March 1988.
16. D. Mayers. Unconditionally secure quantum bit commitment is impossible. Physical Review Letters, 78:3414-3417, April 1997.
17. T. Moran, R. Shaltiel, and A. Ta-Shma. Non-interactive timestamping in the bounded storage model. In Advances in Cryptology - CRYPTO 2004. pages 460-476, 2004.
18. R. Renner and R. König. Universally composable privacy amplification against quantum adversaries. In Theory of Cryptography - TCC 2005, pages 407-425, February 2005.
19. L. Salvail. Quantum bit commitment from a physical assumption. In Advances in Cryptology - CRYPTO 1998, pages 338-353, 1998.
20. P. W. Shor and J. Preskill. Simple proof of security of the BB84 quantum key distribution protocol. Physical Review Letters. 85:441-444, July 2000.
21. M. N. Wegman and J. L. Carter. New classes and applications of hash functions. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science - FOCS 1979, pages 175-182, 1970.