Universally Composable Private Proximity Testing
暂无分享,去创建一个
[1] Per Enge,et al. Robust Location Tag Generation from Noisy Location Data for Security Applications , 2009 .
[2] Barbara Masucci,et al. Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes , 2002, Des. Codes Cryptogr..
[3] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[4] Hideki Imai,et al. On the Key Predistribution System: A Practical Solution to the Key Distribution Problem , 1987, CRYPTO.
[5] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[6] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[7] Chi Sung Laih,et al. Advances in Cryptology - ASIACRYPT 2003 , 2003 .
[8] Ahmad-Reza Sadeghi,et al. Universally Composable Security Analysis of TLS , 2008, ProvSec.
[9] Dan Boneh,et al. Location Privacy via Private Proximity Testing , 2011, NDSS.
[10] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[11] Helger Lipmaa,et al. Verifiable Homomorphic Oblivious Transfer and Private Equality Test , 2003, ASIACRYPT.
[12] Yael Tauman Kalai,et al. A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model , 2010, IACR Cryptol. ePrint Arch..
[13] Carl Pomerance,et al. Advances in Cryptology — CRYPTO ’87 , 2000, Lecture Notes in Computer Science.
[14] Tatsuaki Okamoto,et al. Advances in Cryptology — ASIACRYPT 2000 , 2000, Lecture Notes in Computer Science.
[15] Hugo Krawczyk,et al. Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels , 2001, EUROCRYPT.
[16] Michael Backes,et al. How to Break and Repair a Universally Composable Signature Functionality , 2004, ISC.
[17] Amit Sahai,et al. New Constructions for UC Secure Computation Using Tamper-Proof Hardware , 2008, EUROCRYPT.
[18] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[19] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[20] Goichiro Hanaoka,et al. Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data , 2009, IACR Cryptol. ePrint Arch..
[21] Peter Winkler,et al. Comparing information without leaking it , 1996, CACM.
[22] Hugo Krawczyk,et al. Keying Hash Functions for Message Authentication , 1996, CRYPTO.
[23] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[24] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[25] Ivan Damgård,et al. On the Necessary and Sufficient Assumptions for UC Computation , 2010, TCC.
[26] Jacques Traoré,et al. A fair and efficient solution to the socialist millionaires' problem , 2001, Discret. Appl. Math..
[27] Donald Beaver,et al. Commodity-based cryptography (extended abstract) , 1997, STOC '97.
[28] Neal Koblitz,et al. Advances in Cryptology — CRYPTO ’96 , 2001, Lecture Notes in Computer Science.
[29] Donald Beaver,et al. Server-assisted cryptography , 1998, NSPW '98.
[30] Aggelos Kiayias,et al. Traitor Tracing with Constant Transmission Rate , 2002, EUROCRYPT.
[31] Junji Shikata,et al. Unconditionally Secure Digital Signature Schemes Admitting Transferability , 2000, ASIACRYPT.
[32] Nigel P. Smart,et al. Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings , 2008, EUROCRYPT.
[33] Adam D. Smith,et al. Efficient Two Party and Multi Party Computation Against Covert Adversaries , 2008, EUROCRYPT.