Honey Encryption: Security Beyond the Brute-Force Bound
暂无分享,去创建一个
[1] Douglas N. Hoover,et al. Software smart cards via cryptographic camouflage , 1999, Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344).
[2] Mihir Bellare,et al. Deterministic and Efficiently Searchable Encryption , 2007, CRYPTO.
[3] Victor Shoup,et al. A computational introduction to number theory and algebra , 2005 .
[4] Mihir Bellare,et al. Format-Preserving Encryption , 2009, IACR Cryptol. ePrint Arch..
[5] Marc Fischlin,et al. Random Oracles with(out) Programmability , 2010, ASIACRYPT.
[6] John Gordon,et al. Strong Primes are Easy to Find , 1985, EUROCRYPT.
[7] Rafail Ostrovsky,et al. Deniable Encryption , 1997, IACR Cryptol. ePrint Arch..
[8] Gary L. Miller. Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..
[9] Mihir Bellare,et al. OCB: a block-cipher mode of operation for efficient authenticated encryption , 2001, CCS '01.
[10] Dan Boneh,et al. Kamouflage: Loss-Resistant Password Management , 2010, ESORICS.
[11] A. Paz. Probabilistic algorithms , 2003 .
[12] Alexander Russell,et al. How to fool an unbounded adversary with a short key , 2002, IEEE Transactions on Information Theory.
[13] Adam O'Neill,et al. Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles , 2008, CRYPTO.
[14] Hovav Shacham,et al. Hedged Public-Key Encryption: How to Protect against Bad Randomness , 2009, ASIACRYPT.
[15] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[16] L. Spitzner,et al. Honeypots: Tracking Hackers , 2002 .
[17] Zengjian Hu,et al. On weighted balls-into-bins games , 2005, Theor. Comput. Sci..
[18] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[19] Yevgeniy Dodis,et al. Entropic Security and the Encryption of High Entropy Messages , 2005, TCC.
[20] Chanathip Namprempre,et al. Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm , 2000, Journal of Cryptology.
[21] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[22] John Viega,et al. The Security and Performance of the Galois/Counter Mode (GCM) of Operation , 2004, INDOCRYPT.
[23] Jesper Buus Nielsen,et al. Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case , 2002, CRYPTO.
[24] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.
[25] J. Littlewood,et al. Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes , 1923 .
[26] Mihir Bellare,et al. Multi-instance Security and Its Application to Password-Based Cryptography , 2012, CRYPTO.
[27] Thomas Ristenpart,et al. When Good Randomness Goes Bad: Virtual Machine Reset Vulnerabilities and Hedging Deployed Cryptography , 2010, NDSS.
[28] Salvatore J. Stolfo,et al. Automating the injection of believable decoys to detect snooping , 2010, WiSec '10.
[29] Ronald L. Rivest,et al. Honeywords: making password-cracking detectable , 2013, CCS.
[30] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[31] Thomas Ristenpart,et al. Honey Encryption: Encryption beyond the Brute-Force Barrier , 2014, IEEE Security & Privacy.
[32] Ivan Damgård,et al. On Generation of Probable Primes By Incremental Search , 1992, CRYPTO.
[33] Salvatore J. Stolfo,et al. Baiting Inside Attackers Using Decoy Documents , 2009, SecureComm.
[34] Serge Fehr,et al. On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles , 2008, CRYPTO.
[35] Joseph Bonneau,et al. The Science of Guessing: Analyzing an Anonymized Corpus of 70 Million Passwords , 2012, 2012 IEEE Symposium on Security and Privacy.
[36] Eli Upfal,et al. Balanced Allocations , 1999, SIAM J. Comput..
[37] Ran Canetti,et al. Hardness Amplification of Weakly Verifiable Puzzles , 2005, TCC.