Foundations and applications for secure triggers
暂无分享,去创建一个
Ariel Waissbein | Carlos Sarraute | Ariel Futoransky | Emiliano Kargieman | Carlos Sarraute | Ariel Futoransky | Emiliano Kargieman | A. Waissbein
[1] Adi Shamir,et al. How to share a secret , 1979, CACM.
[2] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[3] Manuel Blum,et al. Coin Flipping by Telephone. , 1981, CRYPTO 1981.
[4] V. Rich. Personal communication , 1989, Nature.
[5] Yvo Desmedt,et al. Threshold Cryptosystems , 1989, CRYPTO.
[6] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[7] Silvio Micali,et al. Secure Computation (Abstract) , 1991, CRYPTO.
[8] Moni Naor,et al. Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.
[9] Oded Goldreich,et al. Foundations of Cryptography (Fragments of a Book) , 1995 .
[10] Ronald L. Rivest,et al. Time-lock Puzzles and Timed-release Crypto , 1996 .
[11] Ran Canetti,et al. Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information , 1997, CRYPTO.
[12] Ronald L. Rivest,et al. All-or-Nothing Encryption and the Package Transform , 1997, FSE.
[13] Ran Canetti,et al. Perfectly one-way probabilistic hash functions (preliminary version) , 1998, STOC '98.
[14] Fritz Hohl,et al. Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts , 1998, Mobile Agents and Security.
[15] Rafail Ostrovsky,et al. Conditional Oblivious Transfer and Timed-Release Encryption , 1999, EUROCRYPT.
[16] Silvio Micali,et al. Lower Bounds for Oblivious Transfer Reductions , 1999, EUROCRYPT.
[17] Birgit Pfitzmann,et al. Composition and integrity preservation of secure reactive systems , 2000, CCS.
[18] Moni Naor,et al. Timed Commitments , 2000, CRYPTO.
[19] Markus Jakobsson,et al. Cryptographic Approaches to Provacy in Forensic DNA Databases , 2000, Public Key Cryptography.
[20] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[21] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[22] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[23] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[24] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[25] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[26] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[27] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[28] Ivan Damgård,et al. Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor , 2001, CRYPTO.
[29] Joos Vandewalle,et al. (How) can mobile agents do secure electronic transactions on untrusted hosts? A survey of the security issues and the current solutions , 2003, TOIT.
[30] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[31] Amit Sahai,et al. Positive Results and Techniques for Obfuscation , 2004, EUROCRYPT.
[32] Ravi Sandhu,et al. ACM Transactions on Information and System Security: Editorial , 2005 .
[33] Oded Goldreich. Foundations of Cryptography: Volume 1 , 2006 .
[34] Madhu Sudan,et al. A Fuzzy Vault Scheme , 2006, Des. Codes Cryptogr..