Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(cryptography). Showing records 1 – 30 of 1573 total matches.

[1] [2] [3] [4] [5] … [53]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Anna University

1. Latha Shanmuga Vadivu, S. Architecture of elliptic curve Cryptography using veriloghdl.

Degree: Information and Communication Engineering, 2014, Anna University

The expansion of the worldwide communication networks such as newlinethe internet and the increased dependency on digitized information in our newlinesociety makes information more vulnerable… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Latha Shanmuga Vadivu, S. (2014). Architecture of elliptic curve Cryptography using veriloghdl. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27232

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Latha Shanmuga Vadivu, S. “Architecture of elliptic curve Cryptography using veriloghdl.” 2014. Thesis, Anna University. Accessed September 21, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/27232.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Latha Shanmuga Vadivu, S. “Architecture of elliptic curve Cryptography using veriloghdl.” 2014. Web. 21 Sep 2020.

Vancouver:

Latha Shanmuga Vadivu S. Architecture of elliptic curve Cryptography using veriloghdl. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Sep 21]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27232.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Latha Shanmuga Vadivu S. Architecture of elliptic curve Cryptography using veriloghdl. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27232

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

2. Zidaric, Nusa. Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography.

Degree: 2020, University of Waterloo

 Today, emerging technologies are reaching astronomical proportions. For example, the Internet of Things has numerous applications and consists of countless different devices using different technologies… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zidaric, N. (2020). Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15928

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zidaric, Nusa. “Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography.” 2020. Thesis, University of Waterloo. Accessed September 21, 2020. http://hdl.handle.net/10012/15928.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zidaric, Nusa. “Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography.” 2020. Web. 21 Sep 2020.

Vancouver:

Zidaric N. Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10012/15928.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zidaric N. Automated Design Space Exploration and Datapath Synthesis for Finite Field Arithmetic with Applications to Lightweight Cryptography. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15928

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rutgers University

3. Durbha, Subramanyam, 1959-. Cryptography and factorization methods in cryptography.

Degree: MS, Mathematics, 2018, Rutgers University

 The Security of the RSA cryptosystem depends on the difficulty of finding the prime factors of large integers. Here we explore some of the factorization… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Durbha, Subramanyam, 1. (2018). Cryptography and factorization methods in cryptography. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55943/

Chicago Manual of Style (16th Edition):

Durbha, Subramanyam, 1959-. “Cryptography and factorization methods in cryptography.” 2018. Masters Thesis, Rutgers University. Accessed September 21, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/55943/.

MLA Handbook (7th Edition):

Durbha, Subramanyam, 1959-. “Cryptography and factorization methods in cryptography.” 2018. Web. 21 Sep 2020.

Vancouver:

Durbha, Subramanyam 1. Cryptography and factorization methods in cryptography. [Internet] [Masters thesis]. Rutgers University; 2018. [cited 2020 Sep 21]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55943/.

Council of Science Editors:

Durbha, Subramanyam 1. Cryptography and factorization methods in cryptography. [Masters Thesis]. Rutgers University; 2018. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55943/


University of Waterloo

4. Schanck, John. Improving post-quantum cryptography through cryptanalysis.

Degree: 2020, University of Waterloo

 Large quantum computers pose a threat to our public-key cryptographic infrastructure. The possible responses are: Do nothing; accept the fact that quantum computers might be… (more)

Subjects/Keywords: cryptography; cryptanalysis; post-quantum cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schanck, J. (2020). Improving post-quantum cryptography through cryptanalysis. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16060

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schanck, John. “Improving post-quantum cryptography through cryptanalysis.” 2020. Thesis, University of Waterloo. Accessed September 21, 2020. http://hdl.handle.net/10012/16060.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schanck, John. “Improving post-quantum cryptography through cryptanalysis.” 2020. Web. 21 Sep 2020.

Vancouver:

Schanck J. Improving post-quantum cryptography through cryptanalysis. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10012/16060.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schanck J. Improving post-quantum cryptography through cryptanalysis. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16060

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Papamanthou, Charalampos. Cryptography for Efficiency: New Directions in Authenticated Data Structures.

Degree: PhD, Computer Science, 2011, Brown University

 Cloud computing has emerged as an important new computational andstorage medium and is increasingly being adopted both by companies and individuals as a means of… (more)

Subjects/Keywords: applied cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Papamanthou, C. (2011). Cryptography for Efficiency: New Directions in Authenticated Data Structures. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11333/

Chicago Manual of Style (16th Edition):

Papamanthou, Charalampos. “Cryptography for Efficiency: New Directions in Authenticated Data Structures.” 2011. Doctoral Dissertation, Brown University. Accessed September 21, 2020. https://repository.library.brown.edu/studio/item/bdr:11333/.

MLA Handbook (7th Edition):

Papamanthou, Charalampos. “Cryptography for Efficiency: New Directions in Authenticated Data Structures.” 2011. Web. 21 Sep 2020.

Vancouver:

Papamanthou C. Cryptography for Efficiency: New Directions in Authenticated Data Structures. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2020 Sep 21]. Available from: https://repository.library.brown.edu/studio/item/bdr:11333/.

Council of Science Editors:

Papamanthou C. Cryptography for Efficiency: New Directions in Authenticated Data Structures. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11333/


Oregon State University

6. Park, Song Jun. Hardware design of scalable and unified modular division and Montgomery multiplication.

Degree: MS, Electrical and Computer Engineering, 2005, Oregon State University

 Modular arithmetic is a basic operation for many cryptography applications such as public key cryptography, key exchange algorithms, digital signatures, and elliptic curve cryptography. Therefore,… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Park, S. J. (2005). Hardware design of scalable and unified modular division and Montgomery multiplication. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/10220

Chicago Manual of Style (16th Edition):

Park, Song Jun. “Hardware design of scalable and unified modular division and Montgomery multiplication.” 2005. Masters Thesis, Oregon State University. Accessed September 21, 2020. http://hdl.handle.net/1957/10220.

MLA Handbook (7th Edition):

Park, Song Jun. “Hardware design of scalable and unified modular division and Montgomery multiplication.” 2005. Web. 21 Sep 2020.

Vancouver:

Park SJ. Hardware design of scalable and unified modular division and Montgomery multiplication. [Internet] [Masters thesis]. Oregon State University; 2005. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1957/10220.

Council of Science Editors:

Park SJ. Hardware design of scalable and unified modular division and Montgomery multiplication. [Masters Thesis]. Oregon State University; 2005. Available from: http://hdl.handle.net/1957/10220

7. Maeda, Masaya. A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Maeda, M. (n.d.). A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/2113

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Maeda, Masaya. “A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed September 21, 2020. http://hdl.handle.net/10061/2113.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Maeda, Masaya. “A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time.” Web. 21 Sep 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Maeda M. A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10061/2113.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Maeda M. A Sufficient Condition under which Security Decision Problem for Cryptographic Protocols is Decidable in Polynomial Time. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/2113

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


Oregon State University

8. Todorov, Georgi. ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier.

Degree: MS, Electrical and Computer Engineering, 2000, Oregon State University

 Modular multiplication is a widely used operation in cryptography. Several well-known applications, such as the decipherment operation of the RSA algorithm, the Diffie-Hellman key exchange… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Todorov, G. (2000). ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/32914

Chicago Manual of Style (16th Edition):

Todorov, Georgi. “ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier.” 2000. Masters Thesis, Oregon State University. Accessed September 21, 2020. http://hdl.handle.net/1957/32914.

MLA Handbook (7th Edition):

Todorov, Georgi. “ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier.” 2000. Web. 21 Sep 2020.

Vancouver:

Todorov G. ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier. [Internet] [Masters thesis]. Oregon State University; 2000. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1957/32914.

Council of Science Editors:

Todorov G. ASIC design, implementation and anaylsis of a scalable high-radix Montgomery Multiplier. [Masters Thesis]. Oregon State University; 2000. Available from: http://hdl.handle.net/1957/32914


Oregon State University

9. Sunar, Berk. Fast Galois field arithmetic for elliptic curve cryptography and error control codes.

Degree: PhD, Electrical and Computer Engineering, 1998, Oregon State University

 Today's computer and network communication systems rely on authenticated and secure transmission of information, which requires computationally efficient and low bandwidth cryptographic algorithms. Among these… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sunar, B. (1998). Fast Galois field arithmetic for elliptic curve cryptography and error control codes. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/33927

Chicago Manual of Style (16th Edition):

Sunar, Berk. “Fast Galois field arithmetic for elliptic curve cryptography and error control codes.” 1998. Doctoral Dissertation, Oregon State University. Accessed September 21, 2020. http://hdl.handle.net/1957/33927.

MLA Handbook (7th Edition):

Sunar, Berk. “Fast Galois field arithmetic for elliptic curve cryptography and error control codes.” 1998. Web. 21 Sep 2020.

Vancouver:

Sunar B. Fast Galois field arithmetic for elliptic curve cryptography and error control codes. [Internet] [Doctoral dissertation]. Oregon State University; 1998. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1957/33927.

Council of Science Editors:

Sunar B. Fast Galois field arithmetic for elliptic curve cryptography and error control codes. [Doctoral Dissertation]. Oregon State University; 1998. Available from: http://hdl.handle.net/1957/33927


Oregon State University

10. Acar, Tolga. High-speed algorithms & architectures for number-theoretic cryptosystems.

Degree: PhD, Electrical and Computer Engineering, 1997, Oregon State University

 Computer and network security systems rely on the privacy and authenticity of information, which requires implementation of cryptographic functions. Software implementations of these functions are… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Acar, T. (1997). High-speed algorithms & architectures for number-theoretic cryptosystems. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/33854

Chicago Manual of Style (16th Edition):

Acar, Tolga. “High-speed algorithms & architectures for number-theoretic cryptosystems.” 1997. Doctoral Dissertation, Oregon State University. Accessed September 21, 2020. http://hdl.handle.net/1957/33854.

MLA Handbook (7th Edition):

Acar, Tolga. “High-speed algorithms & architectures for number-theoretic cryptosystems.” 1997. Web. 21 Sep 2020.

Vancouver:

Acar T. High-speed algorithms & architectures for number-theoretic cryptosystems. [Internet] [Doctoral dissertation]. Oregon State University; 1997. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1957/33854.

Council of Science Editors:

Acar T. High-speed algorithms & architectures for number-theoretic cryptosystems. [Doctoral Dissertation]. Oregon State University; 1997. Available from: http://hdl.handle.net/1957/33854


University of Ottawa

11. Lord, Sébastien. Uncloneable Quantum Encryption via Random Oracles .

Degree: 2019, University of Ottawa

 One of the key distinctions between classical and quantum information is given by the no-cloning theorem: unlike bits, arbitrary qubits cannot be perfectly copied. This… (more)

Subjects/Keywords: Quantum Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lord, S. (2019). Uncloneable Quantum Encryption via Random Oracles . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/38855

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lord, Sébastien. “Uncloneable Quantum Encryption via Random Oracles .” 2019. Thesis, University of Ottawa. Accessed September 21, 2020. http://hdl.handle.net/10393/38855.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lord, Sébastien. “Uncloneable Quantum Encryption via Random Oracles .” 2019. Web. 21 Sep 2020.

Vancouver:

Lord S. Uncloneable Quantum Encryption via Random Oracles . [Internet] [Thesis]. University of Ottawa; 2019. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10393/38855.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lord S. Uncloneable Quantum Encryption via Random Oracles . [Thesis]. University of Ottawa; 2019. Available from: http://hdl.handle.net/10393/38855

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Houston

12. Chandwani, Neeraj. Integrated Quantum Control Protocol.

Degree: MSin Electrical Engineering, Electrical Engineering, 2014, University of Houston

 Classical cryptography protocols are becoming vulnerable due to increasing computer power. However, optical fibers provide another method of securing the communication, by means of quantum… (more)

Subjects/Keywords: Quantum cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chandwani, N. (2014). Integrated Quantum Control Protocol. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/5680

Chicago Manual of Style (16th Edition):

Chandwani, Neeraj. “Integrated Quantum Control Protocol.” 2014. Masters Thesis, University of Houston. Accessed September 21, 2020. http://hdl.handle.net/10657/5680.

MLA Handbook (7th Edition):

Chandwani, Neeraj. “Integrated Quantum Control Protocol.” 2014. Web. 21 Sep 2020.

Vancouver:

Chandwani N. Integrated Quantum Control Protocol. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10657/5680.

Council of Science Editors:

Chandwani N. Integrated Quantum Control Protocol. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/5680


Delft University of Technology

13. Van Vliet, A.H.P. (author). Secure Data Storage Outsourcing with Conjunctive Keyword Search.

Degree: 2009, Delft University of Technology

This thesis in the field of cryptography considers secure data storage outsourcing with keyword search capabilities. To ensure data confidentiality the data is stored in… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Van Vliet, A. H. P. (. (2009). Secure Data Storage Outsourcing with Conjunctive Keyword Search. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a

Chicago Manual of Style (16th Edition):

Van Vliet, A H P (author). “Secure Data Storage Outsourcing with Conjunctive Keyword Search.” 2009. Masters Thesis, Delft University of Technology. Accessed September 21, 2020. http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a.

MLA Handbook (7th Edition):

Van Vliet, A H P (author). “Secure Data Storage Outsourcing with Conjunctive Keyword Search.” 2009. Web. 21 Sep 2020.

Vancouver:

Van Vliet AHP(. Secure Data Storage Outsourcing with Conjunctive Keyword Search. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2020 Sep 21]. Available from: http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a.

Council of Science Editors:

Van Vliet AHP(. Secure Data Storage Outsourcing with Conjunctive Keyword Search. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:aad73ff6-9779-4c83-9106-584b81a2594a


Rochester Institute of Technology

14. Delman, Bethany. Genetic algorithms in cryptography.

Degree: Computer Engineering, 2004, Rochester Institute of Technology

  Genetic algorithms (GAs) are a class of optimization algorithms. GAs attempt to solve problems through modeling a simplified version of genetic processes. There are… (more)

Subjects/Keywords: Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Delman, B. (2004). Genetic algorithms in cryptography. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5456

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Delman, Bethany. “Genetic algorithms in cryptography.” 2004. Thesis, Rochester Institute of Technology. Accessed September 21, 2020. https://scholarworks.rit.edu/theses/5456.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Delman, Bethany. “Genetic algorithms in cryptography.” 2004. Web. 21 Sep 2020.

Vancouver:

Delman B. Genetic algorithms in cryptography. [Internet] [Thesis]. Rochester Institute of Technology; 2004. [cited 2020 Sep 21]. Available from: https://scholarworks.rit.edu/theses/5456.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Delman B. Genetic algorithms in cryptography. [Thesis]. Rochester Institute of Technology; 2004. Available from: https://scholarworks.rit.edu/theses/5456

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Pawlega, Filip. Privately Constrained Testable Pseudorandom Functions.

Degree: 2018, University of Waterloo

 Privately Constrained Pseudorandom Functions allow a PRF key to be delegated to some evaluator in a constrained manner, such that the key’s functionality is restricted… (more)

Subjects/Keywords: cryptography

…theoretical cryptography has expanded considerably from a wealth of new ideas. Nevertheless, long… …cryptography. In Chapter 6, we construct the primitive from lattice assumptions, and prove it… …written in base-2, except where noted. Cryptography. Let λ denote a security parameter. A… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pawlega, F. (2018). Privately Constrained Testable Pseudorandom Functions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13840

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pawlega, Filip. “Privately Constrained Testable Pseudorandom Functions.” 2018. Thesis, University of Waterloo. Accessed September 21, 2020. http://hdl.handle.net/10012/13840.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pawlega, Filip. “Privately Constrained Testable Pseudorandom Functions.” 2018. Web. 21 Sep 2020.

Vancouver:

Pawlega F. Privately Constrained Testable Pseudorandom Functions. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10012/13840.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pawlega F. Privately Constrained Testable Pseudorandom Functions. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13840

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

16. Wu, Jiang. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication.

Degree: 2009, University of Waterloo

 This thesis includes my research on efficient cryptographic protocols, sensor network key management, and radio frequency identification (RFID) authentication protocols. Key exchange, identification, and public… (more)

Subjects/Keywords: cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, J. (2009). Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4501

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wu, Jiang. “Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication.” 2009. Thesis, University of Waterloo. Accessed September 21, 2020. http://hdl.handle.net/10012/4501.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wu, Jiang. “Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication.” 2009. Web. 21 Sep 2020.

Vancouver:

Wu J. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10012/4501.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu J. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4501

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Tartu University

17. Baghery, Karim. Reducing trust and improving security in zk-SNARKs and commitments .

Degree: 2020, Tartu University

 zk-SNARK-id on tõhusad ja praktilised mitteinteraktiivsed tõestussüsteemid, mis on konstrueeritud viitestringi mudelis ning tänu kompaktsetele tõestustele ja väga tõhusale verifitseeritavusele on need laialdaselt kasutusele võetud… (more)

Subjects/Keywords: privacy; cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Baghery, K. (2020). Reducing trust and improving security in zk-SNARKs and commitments . (Thesis). Tartu University. Retrieved from http://hdl.handle.net/10062/68424

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Baghery, Karim. “Reducing trust and improving security in zk-SNARKs and commitments .” 2020. Thesis, Tartu University. Accessed September 21, 2020. http://hdl.handle.net/10062/68424.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Baghery, Karim. “Reducing trust and improving security in zk-SNARKs and commitments .” 2020. Web. 21 Sep 2020.

Vancouver:

Baghery K. Reducing trust and improving security in zk-SNARKs and commitments . [Internet] [Thesis]. Tartu University; 2020. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10062/68424.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Baghery K. Reducing trust and improving security in zk-SNARKs and commitments . [Thesis]. Tartu University; 2020. Available from: http://hdl.handle.net/10062/68424

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Royal Holloway, University of London

18. Renwick, Sarah Louise. Searching on encrypted data.

Degree: PhD, 2018, Royal Holloway, University of London

 Searchable encryption allows a user to outsource encrypted data to a remote server, whilst preserving the user's ability to locate specific data items within the… (more)

Subjects/Keywords: Searchable Encryption; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Renwick, S. L. (2018). Searching on encrypted data. (Doctoral Dissertation). Royal Holloway, University of London. Retrieved from https://pure.royalholloway.ac.uk/portal/en/publications/searching-on-encrypted-data(55aa8f0a-14e7-4ad1-bc41-fe7530998022).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792812

Chicago Manual of Style (16th Edition):

Renwick, Sarah Louise. “Searching on encrypted data.” 2018. Doctoral Dissertation, Royal Holloway, University of London. Accessed September 21, 2020. https://pure.royalholloway.ac.uk/portal/en/publications/searching-on-encrypted-data(55aa8f0a-14e7-4ad1-bc41-fe7530998022).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792812.

MLA Handbook (7th Edition):

Renwick, Sarah Louise. “Searching on encrypted data.” 2018. Web. 21 Sep 2020.

Vancouver:

Renwick SL. Searching on encrypted data. [Internet] [Doctoral dissertation]. Royal Holloway, University of London; 2018. [cited 2020 Sep 21]. Available from: https://pure.royalholloway.ac.uk/portal/en/publications/searching-on-encrypted-data(55aa8f0a-14e7-4ad1-bc41-fe7530998022).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792812.

Council of Science Editors:

Renwick SL. Searching on encrypted data. [Doctoral Dissertation]. Royal Holloway, University of London; 2018. Available from: https://pure.royalholloway.ac.uk/portal/en/publications/searching-on-encrypted-data(55aa8f0a-14e7-4ad1-bc41-fe7530998022).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792812


University of Johannesburg

19. Van der Bank, Dirk Johannes. Die evaluering van 'n aantal kriptologiese algoritmes.

Degree: 2014, University of Johannesburg

M.Sc. (Computer Science)

The main themes of this thesis are the characteristics of natural language, cryptographic algorithms to encipher natural language and possible figures of… (more)

Subjects/Keywords: Cryptography - Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Van der Bank, D. J. (2014). Die evaluering van 'n aantal kriptologiese algoritmes. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/9730

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Van der Bank, Dirk Johannes. “Die evaluering van 'n aantal kriptologiese algoritmes.” 2014. Thesis, University of Johannesburg. Accessed September 21, 2020. http://hdl.handle.net/10210/9730.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Van der Bank, Dirk Johannes. “Die evaluering van 'n aantal kriptologiese algoritmes.” 2014. Web. 21 Sep 2020.

Vancouver:

Van der Bank DJ. Die evaluering van 'n aantal kriptologiese algoritmes. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10210/9730.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Van der Bank DJ. Die evaluering van 'n aantal kriptologiese algoritmes. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/9730

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Johannesburg

20. Herdan, David Errol. A cryptographically secure protocol for key exchange.

Degree: 2014, University of Johannesburg

M.Sc. (Computer Science)

Since the emergence of electronic communication, scientists have strived to make these communication systems as secure as possible. Classical cryptographical methods provided… (more)

Subjects/Keywords: Cryptography - Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Herdan, D. E. (2014). A cryptographically secure protocol for key exchange. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12037

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Herdan, David Errol. “A cryptographically secure protocol for key exchange.” 2014. Thesis, University of Johannesburg. Accessed September 21, 2020. http://hdl.handle.net/10210/12037.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Herdan, David Errol. “A cryptographically secure protocol for key exchange.” 2014. Web. 21 Sep 2020.

Vancouver:

Herdan DE. A cryptographically secure protocol for key exchange. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10210/12037.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Herdan DE. A cryptographically secure protocol for key exchange. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12037

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas A&M University

21. Watkins, Kristopher Lonnie. An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography.

Degree: MS, Mathematics, 2019, Texas A&M University

 When building cryptosystems, cryptographers focus on finding problems that are not believed to be solvable in polynomial-time. Some of the most popular problems they have… (more)

Subjects/Keywords: Post-Quantum Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Watkins, K. L. (2019). An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/188811

Chicago Manual of Style (16th Edition):

Watkins, Kristopher Lonnie. “An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography.” 2019. Masters Thesis, Texas A&M University. Accessed September 21, 2020. http://hdl.handle.net/1969.1/188811.

MLA Handbook (7th Edition):

Watkins, Kristopher Lonnie. “An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography.” 2019. Web. 21 Sep 2020.

Vancouver:

Watkins KL. An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography. [Internet] [Masters thesis]. Texas A&M University; 2019. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/1969.1/188811.

Council of Science Editors:

Watkins KL. An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm and Its Effects on Post-Quantum Cryptography. [Masters Thesis]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/188811


University of Oklahoma

22. Li, Yu-Hsin. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.

Degree: PhD, 2011, University of Oklahoma

 Key generation is an important part of symmetric-key encryption algorithms, such as AES. A key derivation function can be used to generate symmetric cipher session… (more)

Subjects/Keywords: Cryptography; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, Y. (2011). FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319191

Chicago Manual of Style (16th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Doctoral Dissertation, University of Oklahoma. Accessed September 21, 2020. http://hdl.handle.net/11244/319191.

MLA Handbook (7th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Web. 21 Sep 2020.

Vancouver:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Internet] [Doctoral dissertation]. University of Oklahoma; 2011. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/11244/319191.

Council of Science Editors:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Doctoral Dissertation]. University of Oklahoma; 2011. Available from: http://hdl.handle.net/11244/319191

23. Dai, Wei. Statistical Methods in Cryptography.

Degree: 2016, University of California – eScholarship, University of California

 Cryptographic assumptions and security goals are fundamentally distributional. As a result, statistical techniques are ubiquitous in cryptographic constructions and proofs. In this thesis, we build… (more)

Subjects/Keywords: Computer science; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dai, W. (2016). Statistical Methods in Cryptography. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/8j949628

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Dai, Wei. “Statistical Methods in Cryptography.” 2016. Thesis, University of California – eScholarship, University of California. Accessed September 21, 2020. http://www.escholarship.org/uc/item/8j949628.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dai, Wei. “Statistical Methods in Cryptography.” 2016. Web. 21 Sep 2020.

Vancouver:

Dai W. Statistical Methods in Cryptography. [Internet] [Thesis]. University of California – eScholarship, University of California; 2016. [cited 2020 Sep 21]. Available from: http://www.escholarship.org/uc/item/8j949628.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dai W. Statistical Methods in Cryptography. [Thesis]. University of California – eScholarship, University of California; 2016. Available from: http://www.escholarship.org/uc/item/8j949628

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rochester Institute of Technology

24. Snook, Michael. Integer-based fully homomorphic encryption.

Degree: School of Mathematical Sciences (COS), 2011, Rochester Institute of Technology

  The concept of fully homomorphic encryption has been considered the "holy grail" of cryptography since the discovery of secure public key cryptography in the… (more)

Subjects/Keywords: Cryptography; Encryption; Homomorphic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Snook, M. (2011). Integer-based fully homomorphic encryption. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/7018

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Snook, Michael. “Integer-based fully homomorphic encryption.” 2011. Thesis, Rochester Institute of Technology. Accessed September 21, 2020. https://scholarworks.rit.edu/theses/7018.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Snook, Michael. “Integer-based fully homomorphic encryption.” 2011. Web. 21 Sep 2020.

Vancouver:

Snook M. Integer-based fully homomorphic encryption. [Internet] [Thesis]. Rochester Institute of Technology; 2011. [cited 2020 Sep 21]. Available from: https://scholarworks.rit.edu/theses/7018.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Snook M. Integer-based fully homomorphic encryption. [Thesis]. Rochester Institute of Technology; 2011. Available from: https://scholarworks.rit.edu/theses/7018

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

25. Prahesa Kusuma Setia, Prahesa (author). Privacy-Preserving Data Aggregation in Peer-to-Peer Network: A Multiparty Computation Approach.

Degree: 2017, Delft University of Technology

Current interconnected society provides us with numerous devices communicating with one another. Exchange of data thus become an integral part in our live. Data become… (more)

Subjects/Keywords: cryptography; Privacy; Network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Prahesa Kusuma Setia, P. (. (2017). Privacy-Preserving Data Aggregation in Peer-to-Peer Network: A Multiparty Computation Approach. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d512b49d-665d-461c-8317-db7da3ed8eec

Chicago Manual of Style (16th Edition):

Prahesa Kusuma Setia, Prahesa (author). “Privacy-Preserving Data Aggregation in Peer-to-Peer Network: A Multiparty Computation Approach.” 2017. Masters Thesis, Delft University of Technology. Accessed September 21, 2020. http://resolver.tudelft.nl/uuid:d512b49d-665d-461c-8317-db7da3ed8eec.

MLA Handbook (7th Edition):

Prahesa Kusuma Setia, Prahesa (author). “Privacy-Preserving Data Aggregation in Peer-to-Peer Network: A Multiparty Computation Approach.” 2017. Web. 21 Sep 2020.

Vancouver:

Prahesa Kusuma Setia P(. Privacy-Preserving Data Aggregation in Peer-to-Peer Network: A Multiparty Computation Approach. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2020 Sep 21]. Available from: http://resolver.tudelft.nl/uuid:d512b49d-665d-461c-8317-db7da3ed8eec.

Council of Science Editors:

Prahesa Kusuma Setia P(. Privacy-Preserving Data Aggregation in Peer-to-Peer Network: A Multiparty Computation Approach. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:d512b49d-665d-461c-8317-db7da3ed8eec


Delft University of Technology

26. Hoogland, Mathijs (author). A Distributed Public Key Infrastructure for the IoT.

Degree: 2018, Delft University of Technology

The role of Internet of Things (IoT) devices is becoming larger in our day-to-day life. More and more, devices are used to help with simple… (more)

Subjects/Keywords: cryptography; pki; security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hoogland, M. (. (2018). A Distributed Public Key Infrastructure for the IoT. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d028fa67-3040-4ab2-96fb-b859e77be8ae

Chicago Manual of Style (16th Edition):

Hoogland, Mathijs (author). “A Distributed Public Key Infrastructure for the IoT.” 2018. Masters Thesis, Delft University of Technology. Accessed September 21, 2020. http://resolver.tudelft.nl/uuid:d028fa67-3040-4ab2-96fb-b859e77be8ae.

MLA Handbook (7th Edition):

Hoogland, Mathijs (author). “A Distributed Public Key Infrastructure for the IoT.” 2018. Web. 21 Sep 2020.

Vancouver:

Hoogland M(. A Distributed Public Key Infrastructure for the IoT. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Sep 21]. Available from: http://resolver.tudelft.nl/uuid:d028fa67-3040-4ab2-96fb-b859e77be8ae.

Council of Science Editors:

Hoogland M(. A Distributed Public Key Infrastructure for the IoT. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:d028fa67-3040-4ab2-96fb-b859e77be8ae


University of Waterloo

27. Brydon, Dale. On the Security of Leakage Resilient Public Key Cryptography.

Degree: 2012, University of Waterloo

 Side channel attacks, where an attacker learns some physical information about the state of a device, are one of the ways in which cryptographic schemes… (more)

Subjects/Keywords: Cryptography; Leakage Resilient

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Brydon, D. (2012). On the Security of Leakage Resilient Public Key Cryptography. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6676

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Brydon, Dale. “On the Security of Leakage Resilient Public Key Cryptography.” 2012. Thesis, University of Waterloo. Accessed September 21, 2020. http://hdl.handle.net/10012/6676.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Brydon, Dale. “On the Security of Leakage Resilient Public Key Cryptography.” 2012. Web. 21 Sep 2020.

Vancouver:

Brydon D. On the Security of Leakage Resilient Public Key Cryptography. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10012/6676.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brydon D. On the Security of Leakage Resilient Public Key Cryptography. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6676

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Tartu University

28. Siim, Janno. Non-interactive shuffle arguments .

Degree: 2020, Tartu University

 Demokraatliku riigi toimimiseks on turvaline hääletussüsteem esmatähtis. E-hääletus on korraldajale odavam ning valijale mugavam. Samas kaasnevad sellega ka paljud uued turvariskid ja tehnilised väljakutsed. Üks… (more)

Subjects/Keywords: cryptography; e-voting

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Siim, J. (2020). Non-interactive shuffle arguments . (Thesis). Tartu University. Retrieved from http://hdl.handle.net/10062/68431

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Siim, Janno. “Non-interactive shuffle arguments .” 2020. Thesis, Tartu University. Accessed September 21, 2020. http://hdl.handle.net/10062/68431.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Siim, Janno. “Non-interactive shuffle arguments .” 2020. Web. 21 Sep 2020.

Vancouver:

Siim J. Non-interactive shuffle arguments . [Internet] [Thesis]. Tartu University; 2020. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10062/68431.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Siim J. Non-interactive shuffle arguments . [Thesis]. Tartu University; 2020. Available from: http://hdl.handle.net/10062/68431

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Tulane University

29. Fenske, Ellis. Anonymity and Linkability.

Degree: 2018, Tulane University

This thesis considers systems for anonymous communication between users of a cybersystem. Specifically, we consider the scenario where communications generated by the same user repeatedly… (more)

Subjects/Keywords: Anonymity; Privacy; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fenske, E. (2018). Anonymity and Linkability. (Thesis). Tulane University. Retrieved from https://digitallibrary.tulane.edu/islandora/object/tulane:79040

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fenske, Ellis. “Anonymity and Linkability.” 2018. Thesis, Tulane University. Accessed September 21, 2020. https://digitallibrary.tulane.edu/islandora/object/tulane:79040.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fenske, Ellis. “Anonymity and Linkability.” 2018. Web. 21 Sep 2020.

Vancouver:

Fenske E. Anonymity and Linkability. [Internet] [Thesis]. Tulane University; 2018. [cited 2020 Sep 21]. Available from: https://digitallibrary.tulane.edu/islandora/object/tulane:79040.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fenske E. Anonymity and Linkability. [Thesis]. Tulane University; 2018. Available from: https://digitallibrary.tulane.edu/islandora/object/tulane:79040

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

30. LeGrow, Jason. Post-Quantum Security of Authenticated Key Establishment Protocols.

Degree: 2016, University of Waterloo

 We present a security model for authenticated key establishment that allows for quantum interactions between the adversary and quantum oracles that emulate classical parties, resulting… (more)

Subjects/Keywords: Cryptography; Key Establishment; Elliptic Curve Cryptography; Post-Quantum Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

LeGrow, J. (2016). Post-Quantum Security of Authenticated Key Establishment Protocols. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10386

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

LeGrow, Jason. “Post-Quantum Security of Authenticated Key Establishment Protocols.” 2016. Thesis, University of Waterloo. Accessed September 21, 2020. http://hdl.handle.net/10012/10386.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

LeGrow, Jason. “Post-Quantum Security of Authenticated Key Establishment Protocols.” 2016. Web. 21 Sep 2020.

Vancouver:

LeGrow J. Post-Quantum Security of Authenticated Key Establishment Protocols. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Sep 21]. Available from: http://hdl.handle.net/10012/10386.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

LeGrow J. Post-Quantum Security of Authenticated Key Establishment Protocols. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10386

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [53]

.