Secure bit commitment from relativistic constraints

A. Rényi, “On Measures of Information and Entropy,” in Proc. Symp. on Math., Stat. and Probability . Berkeley: University of California Press, 1961, pp. 547–561

1961

Earlier work this paper cites.

W. Hoeffding, “Probability Inequalities for Sums of Bounded Random Variables,” J. Amer. Statistical Assoc. , vol. 58, pp. 13–30, Mar. 1963

1963

Earlier work this paper cites.

M. O. Rabin, “How to Exchange Secrets with Oblivious Transfer,” Aiken Computation Lab, Harvard University, Tech. Rep., 1981

1981

Earlier work this paper cites.

C. H. Bennett and G. Brassard, “Quantum Cryptography: Public Key Distribution and Coin Tossing,” in Proc. IEEE Int. Conf. on Comp., Sys. and Signal Process. Bangalore: IEEE, 1984, pp. 175–179

1984

Earlier work this paper cites.

A. Uhlmann, “The Transition Probability for States of Star-Algebras,” Ann. Phys. , vol. 497, no. 4, pp. 524–532, 1985

1985

Earlier work this paper cites.

J. Kilian, “Founding crytpography on oblivious transfer,” in Proc. ACM STOC . New York, New York, USA: ACM Press, 1988, pp. 20–31. [Online]. Available: http://portal.acm.org/citation.cfm?doid=62212.62215

1988

Earlier work this paper cites.

M. Ben-Or, S. Goldwasser, J. Kilian, and A. Widgerson, “Multi-Prover Interactive Proofs: How to Remove Intractability,” in Proc. ACM STOC . New York, New York, USA: ACM Press, 1988, pp. 113–131. [Online]. Available: http://portal.acm.org/citation.cfm?doid=62212.62223

1988

Earlier work this paper cites.

U. M. Maurer, “A Provably-Secure Strongly-Randomized Cipher,” in Proc. EUROCRYPT , 1990, pp. 361–373

1990

Earlier work this paper cites.

D. Mayers, “Unconditionally Secure Quantum Bit Commitment is Impossible,” Phys. Rev. Lett. , vol. 78, no. 17, pp. 3414–3417, Apr. 1997. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.78.3414

1997

Earlier work this paper cites.

H.-K. Lo and H. F. Chau, “Is Quantum Bit Commitment Really Possible?” Phys. Rev. Lett. , vol. 78, no. 17, pp. 3410–3413, Apr. 1997. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.78.3410

1997

Earlier work this paper cites.

C. Crépeau, “Efficient Cryptographic Protocols Based on Noisy Channels,” in Proc. EUROCRYPT , 1997, pp. 306–317

1997

Earlier work this paper cites.

Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, “Protecting Data Privacy in Private Information Retrieval Schemes,” in Proc. ACM STOC . New York, New York, USA: ACM Press, 1998, pp. 151–160. [Online]. Available: http://portal.acm.org/citation.cfm?doid=276698.276723

1998

Earlier work this paper cites.

R. L. Rivest, “Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer,” Nov. 1999

1999

Earlier work this paper cites.

A. Kent, “Unconditionally Secure Bit Commitment,” Phys. Rev. Lett. , vol. 83, no. 7, pp. 1447–1450, Aug. 1999. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.83.1447

1999

Earlier work this paper cites.

M. Naor and B. Pinkas, “Distributed Oblivious Transfer,” in Proc. ASIACRYPT , 2000, pp. 205–219

2000

Earlier work this paper cites.

T. Malkin, “A Study of Secure Database Access and General Two-Party Computation,” Ph.D. dissertation, Massachusetts Institute of Technology, Feb. 2000

2000

Cited alongside, same era.

P. Dumais, D. Mayers, and L. Salvail, “Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation,” in Proc. EUROCRYPT , 2000, pp. 300–315

2000

Cited alongside, same era.

D. Boneh and M. Naor, “Timed Commitments,” in Proc. CRYPTO , 2000, pp. 236–254

2000

Cited alongside, same era.

R. W. Spekkens and T. Rudolph, “Degrees of Concealment and Bindingness in Quantum Bit Commitment Protocols,” Phys. Rev. A , vol. 65, no. 1, pp. 1–10, Dec. 2001. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.65.012310

2001

Cited alongside, same era.

A. Winter, A. C. A. Nascimento, and H. Imai, “Commitment Capacity of Discrete Memoryless Channels,” in Proc. Cryptography and Coding , Apr. 2003, pp. 35–51. [Online]. Available: http://arxiv.org/abs/cs/0304014

S. Wehner, C. Schaffner, and B. M. Terhal, “Cryptography from Noisy Storage,” Phys. Rev. Lett. , vol. 100, no. 22, pp. 1–4, Jun. 2008. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.100.220502

2008

Later among the works it cites.

K. Brádler, P. Hayden, P. Panangaden, and K. Bradler, “Private information via the Unruh effect,” Journal of High Energy Physics , vol. 2009, no. 08, pp. 074–074, Aug. 2009. [Online]. Available: http://stacks.iop.org/1126-6708/2009/i=08/a=074?key=crossref.61f7b7cc05043c060d308bd53c9f471b

2009

Later among the works it cites.

R. König, R. Renner, and C. Schaffner, “The Operational Meaning of Min- and Max-Entropy,” IEEE Trans. on Inf. Theory , vol. 55, no. 9, pp. 4337–4347, Sep. 2009. [Online]. Available: http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5208530

2009

Later among the works it cites.

C. Schaffner, “Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model,” Phys. Rev. A , vol. 82, no. 3, pp. 1–12, Sep. 2010. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.82.032308