Search Results

1 - 10 of 145 items :

Clear All

.-RISTENPART, T.: Multi-property-preserving hash domain extension and the EMD transform , in: Advances in Cryptology-ASIACRYPT ’06 (X. Lai et al., eds.), Shanghai, China, 2006, Lecture Notes in Comput. Sci., Vol. 4284, Springer-Verlag, Berlin, 2006, pp. 299-314. [4] BELLARE, M.-ROGAWAY, P.: Random oracles are practical: a paradigm for designing efficient protocols , in: 1st ACM Conf. on Comput. and Commun. Security-CCCS ’93 (D. Denning et al., eds.), Fairfax, VA, USA, 1993, ACM, New York, 1993, pp. 62-73. [5] BIHAM, E.-DUNKELMAN, O.: A framework for iterative hash functions

Its Comparison with Relational Databases. – International Journal of Applied Information Systems (IJAIS), Vol. 5 , 2013, No 4, pp. 16-19. 7. Damesha, H. Object Oriented Database Management Systems-Concepts, Advantages, Limitations and Comparative Study with Relational Database Management Systems. – Global Journal of Computing Science and Technology: Software & Data Engineering, Vol. 15 , 2015, No 3, pp. 1-9. 8. Liu, H. Oracle Database Performance and Scalability: A Quantitative Approach. Wiley-IEEE Computer Society, New

R eferences 1. Clarke, J., 2013. Oracle Exadata Recipes . New York: Apress. 2. Farooq, T., Kim, C., Vengurlekar, N., Avantsa, S., Harrison, G., Hussain, S.J., 2015. Oracle Exadata Expert’s Handbook . Boston: Addison-Wesley. 3. Fotache, M. and Hrubaru, I. 2016a. Big Data Technology on Medium-Sized Data. Preliminary Results for Non-Aggregate Queries. Proc. of the 15th International Conference on Informatics in Economy (IE 2016) , Cluj-Napoca, Romania, June 2-5, 2016, pp.273-278 4. Fotache, M. and Hrubaru, I., 2016b. Performance Analysis of Two Big Data

Works Cited Auster, Paul. Oracle Night . London: Faber and Faber Limited, 2004. Print. Auster, Paul. Hand to Mouth: A Chronicle of Early Failure . London: Faber and Faber, 1997. Print. Derrida, Jacques. “Structure, Sign, and Play in the Human Sciences.” Twentieth Century Literary Theory . Ed. Vassilis Lambropoulos and David Neal Miller. New York: State University of New York Press, 1987. Print. Freud, Sigmund. Civilization and Its Discontents . Eastford: Martino Fine Books, 2010. Print. Freud, Sigmund. The Origins of Psycho-Analysis: Letters to Wilhelm

, critique. Big Data & Society , 1(2), 2014. [38] A. Mani, T. Wilson-Brown, R. Jansen, A. Johnson, and M. Sherr. Understanding tor usage with privacy-preserving measurement. In IMC , 2018. [39] N. Mathews, P. Sirinam, and M. Wright. Understanding feature discovery in website fingerprinting attacks. In 2018 IEEE Western New York Image and Signal Processing Workshop (WNYISPW) , pages 1–5. IEEE, 2018. [40] R. Merget, J. Somorovsky, N. Aviram, C. Young, J. Fliegenschmidt, J. Schwenk, and Y. Shavitt. Scalable scanning and automatic classification of tls padding oracle


This essay’s content is rendered by the titles of the successive sections. 1. Effective solvability versus intuitive solvability. — 2. Decidability, i.e. effective solvability, in predicate logic. The speedup phenomenon — 3. Contributions of the second-order logic to the problems of solvability — 4. The infinite progress of science in the light of Turing’s idea of the oracle. The term “oracle” is a technical counterpart of the notion of mathematical intuition.

A more detailed summary can be obtained through juxtaposing the textboxes labelled with letters A...F. Conclusion: in the progress of science an essential role is played by the feedback between intellectual intuitions (intuitive solvability) and algorithmic procedures (effective solvability).


Nested symmetric encryption is a well-known technique for low-latency communication privacy. But just what problem does this technique aim to solve? In answer, we provide a provable-security treatment for onion authenticated-encryption (onion-AE). Extending the conventional notion for authenticated-encryption, we demand indistinguishability from random bits and time-of-exit authenticity verification. We show that the encryption technique presently used in Tor does not satisfy our definition of onion-AE security, but that a construction by , based on a strong, tweakable, wideblock PRP, does do the job. We go on to discuss three extensions of onion-AE, giving definitions to handle inbound flows, immediate detection of authenticity errors, and corrupt ORs.

REFERENCES Aggregate Operations. The Java™ Tutorials. 2017. © Oracle. [online]. [cit. 2017-03-10]. Available on internet: ⟨ ⟩. API Specification. Java™ Platform, Standard Ed. 8. 2017. © Oracle 1993–2017. [online]. [cit. 2017-03-10]. Available on internet: ⟨ ⟩. Class ArrayList<E>. Java™ Platform Standard Ed. 8. 2017. © Oracle. [online]. [cit. 2017-03-10]. Available on internet: ⟨

REFERENCES [1] COURTOIS, N. T.: : Cryptanalysis of GOST , (a very long extended set of slides about the cryptanalysis of GOST, 2010–2014), ; (An earlier and shorter version was presented at 29C3 Conference at 29th Chaos Communication Congress (29C3), December 27–30, 2012, in Hamburg, Germany). [2] _____ Decryption oracle slide attacks on T-310 , Cryptologia, 42 (2018), no. 3, 191–204; [3] _____ Data Encryption Standard (DES) (slides used in GA


In order to keep the confidential data in the cloud against unauthorized parties, a cryptographic access control solution based on Attribute-Based Encryption (ABE) and Identity-Based Signature (IBS) is introduced in this paper. Under the premise that cloud service provider is untrustful, the proposed scheme can ensure the data security of the cloud storage system in an open environment, as well as reduce the complexity of management. Analysis and experimental results show that the scheme can be semantically secure against adaptive chosen ciphertext attacks under the random oracle model. Our concrete access control scheme can enhance the efficiency of the cloud to a certain extent.