A5070910299- Cryptography and Data Security
- Complexity and Algorithms in Graphs
- Cryptographic Implementations and Security
- Coding theory and cryptography
- Privacy-Preserving Technologies in Data
- Cryptography and Residue Arithmetic
- Chaos-based Image/Signal Encryption
- Internet Traffic Analysis and Secure E-voting
- Cooperative Communication and Network Coding
- graph theory and CDMA systems
- Network Security and Intrusion Detection
- Caching and Content Delivery
- Physical Unclonable Functions (PUFs) and Hardware Security
- Quantum Computing Algorithms and Architecture
- Cloud Data Security Solutions
- Cybersecurity and Cyber Warfare Studies
- Advanced Malware Detection Techniques
- Algebraic Geometry and Number Theory
- Internet of Things and Social Network Interactions
- Opportunistic and Delay-Tolerant Networks
- IPv6, Mobility, Handover, Networks, Security
- Advanced Data Storage Technologies
- Advanced Graph Theory Research
- Complex Network Analysis Techniques
- Quantum-Dot Cellular Automata
Ewha Womans University Medical Center
2023
Ewha Womans University
2019-2023
Ulsan National Institute of Science and Technology
2010-2017
University of Minnesota
2009-2010
University of Minnesota System
2009
Twin Cities Orthopedics
2009
Electronics and Telecommunications Research Institute
2007
National Security Research Institute
2004-2006
First Research Institute of the Ministry of Public Security
2004
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed social are fast mixing, and many recently proposed designs such systems make crucial use this property. However, whether real-world really mixing not verified before, could potentially affect performance based on To address problem, we measure time several graphs, takes a random walk graph approach stationary distribution graph,...
Homomorphic authenticated encryption allows implicit computation on plaintexts using corresponding ciphertexts without losing privacy, and provides authenticity of the resultant plaintext when performing a decryption. However, due to its special functionality, security notions homomorphic is somewhat complicated construction fully has never been given. In this work, we propose new notion first encryption. Our unified definition for data privacy Moreover, our simpler stronger than previous...
A cryptographic network file system has to guarantee confidentiality and integrity of its files, also it support random access. For this purpose, existing designs mainly rely on(often ad-hoc) combination Merkle hash tree with a block cipher mode encryption. In paper, we propose new design based on MAC construction which uses universal-hash stateful MAC. This enables standard model security proof better performance compared tree. We formally define the notions for encryption prove that our...
In this paper, we examine homomorphic signatures that can be used to protect the integrity of network coding. particular, Yu et al. proposed an RSA-based signature scheme recently for purpose. We show their in fact does not satisfy required property, and further, even though it fixed easily, still allows no-message forgery attacks.
준동형 MAC은 데이터의 무결성을 보호하면서도 제 3자에 의한 데이터 처리를 허용하는 암호학적 개념이다. 본 논문에서는 새로운 MAC을 제시하고 그 안전성을 증명하도록 한다. 논문의 정수에 기반하고 있고, 단지 안전한 PRF의 존재성만을 가정하며, 실용적인 Catalano-Fiore MAC과 비견할 만한 효율성을 갖는다. 방식은 공격자가 MAC 검증 질의를 할 수 있는 환경에서도 위조 불가능하며, 이 안전성은 강한 불가능성을 보이는 방법으로 증명되었다. Homomorphic is a cryptographic primitive which protects authenticity of data, while allowing homomorphic evaluation such protected data. In this paper, we present new MAC, based on integers, relying only the existence secure PRFs, and...