Back
 JIS  Vol.8 No.4 , October 2017
Ambiguous Multi-Symmetric Scheme and Applications
Abstract:
This paper introduces and evaluates the performance of a novel cipher scheme, Ambiguous Multi-Symmetric Cryptography (AMSC), which conceals multiple coherent plain-texts in one cipher-text. The cipher-text can be decrypted by different keys to produce different plain-texts. Security analysis showed that AMSC is secure against cipher-text only and known plain-text attacks. AMSC has the following applications: 1) it can send multiple messages for multiple receivers through one cipher-text; 2) it can send one real message and multiple decoys for camouflage; and 3) it can send one real message to one receiver using parallel processing. Performance comparison with leading symmetric algorithms (DES, AES and RC6) demonstrated AMSC’s efficiency in execution time.
Cite this paper: Bassous, R. , Mansour, A. , Bassous, R. , Fu, H. , Zhu, Y. and Corser, G. (2017) Ambiguous Multi-Symmetric Scheme and Applications. Journal of Information Security, 8, 383-401. doi: 10.4236/jis.2017.84024.
References

[1]   Canetti, R., Dwork, C., Naor, M. and Ostrovsky, R. (1997) Deniable Encryption. In: Advances in Cryptology CRYPTO’97, Springer, Berlin, 90-104.
https://doi.org/10.1007/BFb0052229

[2]   Bojinov, H., Bursztein, E., Boyen, X. and Boneh, D. (2010) Kamouage: Loss-Resistant Password Management. In: Computer Security-ESORICS 2010, Springer, Berlin, 286-302.

[3]   Juels, A. and Ristenpart, T. (2014) Honey Encryption: Security beyond the Brute-Force Bound. In: Advances in Cryptology-EUROCRYPT 2014, Springer, Berlin, 293-310.
https://doi.org/10.1007/978-3-642-55220-5_17

[4]   Bassous, R., Bassous, R., Fu, H. and Zhu, Y. (2015) Ambiguous Multi-Symmetric Cryptography. In: Communications (ICC), 2015 IEEE International Conference on, 7394-7399.

[5]   Schneier, B. (1996) Applied Cryptography. 2nd Edition, John Wiley & Sons, Hoboken, New Jersey.

[6]   ONeill, A., Peikert, C. and Waters, B. (2011) Bi-Deniable Public-Key Encryption. In: Annual Cryptology Conference, Springer, Berlin, 525-542.

[7]   Sahai, A. and Waters, B. (2005) Fuzzy identity-based encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, 457-473.
https://doi.org/10.1007/11426639_27

[8]   Shamir, A. (1979) How to Share a Secret. Communications of the ACM, 22, 612-613.
https://doi.org/10.1145/359168.359176

[9]   Mignotte, M. (1983) How to Share a Secret. In: Cryptography, Springer, Berlin, 371-375.
https://doi.org/10.1007/3-540-39466-4_27

[10]   Asmuth, C. and Bloom, J. (1983) A Modular Approach to Key Safe-Guarding. IEEE Transactions on Information Theory, 29, 208-210.
https://doi.org/10.1109/TIT.1983.1056651

[11]   Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2001) Introduction to Algorithms. 2nd Edition, MIT Press and McGraw-Hill.

[12]   Biryukov, A. and Kushilevitz, E. (1998) From Differential Cryptanalysis to Ciphertext-Only Attacks. In: Advances in Cryptology CRYPTO’98, Springer, Berlin, 72-88.
https://doi.org/10.1007/BFb0055721

[13]   Reynard, R. (1997) Secret Code Breaker II: A Cryptanalyst’s Handbook. Vol. 2, Smith & Daniel.

[14]   Mollin, R.A. (1990) Number Theory. Proceedings of the 1st Conference of the Canadian Number Theory Association, Banff, 17-27 April 1988, Vol. 1.

[15]   Nathanson, M.B. (2007) Affne Invariants, Relatively Prime Sets, and a Phi Function for Subsets of {1, 2,..., n}. Integers, 7, A1.

[16]   Norman Routledge (2008) Computing Farey Series. The Mathematical Gazette, 55-62.

[17]   Stack Exchange (2013) Generating All Co-Prime Pairs within Limits.
http://math.stackexchange.com/questions/422830/generating-all-coprime-pairs-within-limits

[18]   Berggren, B. (1934) Pytagoreiska trianglar. Elementa: Tidskrift för elementär matematik, fysik och kemi, 17, 129-139. (in Swedish)

[19]   Stackoverflow (2013) Proof: Pythagorean Triple Algorithm Is Faster by Euclid’s Formula?
http://stackoverflow.com/questions/18294496/proof-pythagorean-triple-algorithm-is-faster-by-euclids-formula

[20]   Bellare, M., Krovetz, T. and Rogaway, P. (1998) Luby-Rackoff Back-Wards: Increasing Security by Making Block Ciphers Non-Invertible. In: Advances in Cryptology Eurocrypt’98, Springer, Berlin, 266-280.
https://doi.org/10.1007/BFb0054132

[21]   Hall, C., Wagner, D., Kelsey, J. and Schneier, B. (1998) Building Prfs from Prps. In: Advances in Cryptology Crypto’98, Springer, Berlin, 370-389.
https://doi.org/10.1007/BFb0055742

[22]   Lucks, S. (2000) The Sum of Prps Is a Secure Prf. In: Advances in Cryptology Eurocrypt 2000, Springer, Berlin, 470-484.
https://doi.org/10.1007/3-540-45539-6_34

[23]   Paar, C. and Pelzl, J. (2009) Understanding Cryptography: A Textbook for Students and Practitioners. Springer Science & Business Media, Berlin.

[24]   Menezes, A.J., Van Oorschot, P.C. and Vanstone, S.A. (1996) Handbook of Applied Cryptography. CRC Press.

[25]   Singh, S. (2000) The Code Book: The Secret History of Codes and Codebreaking. Fourth Estate, London.

[26]   Matsui, M. (1994) Linear Cryptanalysis Method for Des Cipher. In: Advances in Cryptology Eurocrypt’93, Springer, Berlin, 386-397.
https://doi.org/10.1007/3-540-48285-7_33

[27]   Cramer, R. and Shoup, V. (1998) A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In: Advances in Cryptology CRYPTO’98, Springer, Berlin, 13-25.
https://doi.org/10.1007/BFb0055717

[28]   Goldwasser, S. and Micali, S. (1984) Probabilistic Encryption. Journal of Computer and System Sciences, 28, 270-299.

[29]   Wikipedia. Computational Complexity of Mathematical Operations.

[30]   Math Stack Exchange (2014) What Is the Time Complexity of Euclid’s Algorithm?
http://math.stackexchange.com/questions/258596/what-is-the-time-complexity-of-euclids-algorithm-upper-bound-lower-bound-and-a

[31]   National Institute of Standards and Technology (2002) Security Requirements for Cryptographic Modules.

[32]   Bouncy Castle (2011) The Legion of the Bouncy Castle.
http://www.bouncycastle.org/csharp/

 
 
Top