ScholarWorks@Hanyang University: Oh, Hyun Ok

Detailed Information

Oh, Hyun Ok (오현옥)

COLLEGE OF ENGINEERING (DEPARTMENT OF INFORMATION SYSTEMS)

Research Area: 암호학, 블록체인, 컴퓨터구조

Tel 02-2220-2395
Homepage

ResearcherID ORCiD Scopus Google Scholar ID ResearchGate

Keyword

Digital signature:5||Privacy:4||Reliability:3||zkSNARK:3||scratch pad memory:3||Forward security:3||Synchronous dataflow graph:3||SSD:3||Intelligent SSD:3||ID based:2||subset difference:2||synchronous dataflow:2||Blockchain:2||Synchronous dataflow:2||broadcast encryption:2||multicore architecture:2||Endurance:2||Mapping:2||SDF graph:2||SNARK:2||Memory management:2||Performance:2||Performance analysis:2||prefetching:2||privacy:2||Scheduling:2||public key encryption:2||Algorithms:2||Cryptography:2||Polynomials:2||Private key generator:2||Collaborative processing:2||Heterogeneous:2||Multiprocessor scheduling:2||memory overlay:2||Hybrid memory:2||Energy:1||Energy consumption:1||Energy minimization:1||Error correction codes:1||Faces:1||Factoring:1||Failureaware scheduling:1||Fast signing/update:1||Force:1||Forward secure:1||Forwardsecure signature:1||Functional simulation:1||GPU:1||Genetic algorithm:1||Groups of unknown order:1||Hardware:1||Heterogeneous scheduling:1||IP multicast:1||In storage processing:1||Information systems:1||Join:1||Key delegation:1||Knowledge sharing:1||Library task:1||Logic gates:1||Logistics:1||Loop parallelization:1||Magnetic cores:1||Main memory:1||Mathematical model:1||Metaheuristic:1||Modelbased design:1||Multicore embedded systems:1||Multiprocessor:1||Multitask:1||Multicore processing:1||Object detection:1||PRAM:1||Pairingbased zkSNARK:1||Parallel and distributed optimization framework:1||Parallel processing:1||Parallel programming:1||Partitioned scheduling:1||Pattern:1||Permanent fault:1||Polynomial commitment scheme:1||Program processors:1||Protocols:1||Prototypes:1||Proven security:1||Public blockchain:1||Public key:1||RSA:1||Response time analysis:1||Retention time:1||SDF:1||STTMRAM:1||Scalability:1||Scan:1||Schedule:1||Scheduling algorithm:1||Scratchpad memory:1||Secure multicast:1||Security:1||Servers:1||Simulation:1||Simulatorbased evaluation:1||Smart contract:1||Smart contracts:1||Static scheduling:1||Static task mapping:1||Subset difference:1||Surveillance:1||Task graph:1||Task migration:1||Task model:1||Task rescheduling:1||Throughput:1||Throughput constraint:1||Timing simulation:1||Traceability:1||Transparent:1||Unified modeling language:1||Vectors:1||Verifiable Credentials:1||Verifiable computation:1||Wildcard:1||Wildcard identity based encryption:1||Worst case response time:1||Worstcase contention delay:1||Worstcase response time:1||Zeroknowledge proof:1||accumulators:1||active SSD:1||attribute based signature:1||authentication:1||big data mining:1||bit flip:1||buffer size minimization:1||computer architecture:1||constant ciphertext:1||cryptography:1||dataintensive computing:1||digital signature:1||distributed realtime embedded system:1||dynamic mapping:1||dynamic scheduling:1||embedded software:1||encryptandprove:1||encryption:1||energyefficient computing:1||energy/ latency minimization:1||filtering:1||forwardsecure signature:1||image authentication:1||instorage processing:1||integer linear programming:1||key delegation:1||main memory:1||minimal secure operation:1||mode transition delay:1||modeoverlapped schedule:1||modelbased desig:1||modeling:1||multi level cell memory:1||multimode dataflow:1||multiprocessor:1||multiprocessor scheduling:1||nonlinear cost function:1||optimal algorithm:1||pairingbased cryptography:1||parallel execution:1||parallel programming:1||pattern:1||phase change RAM:1||physical security:1||privacypreserving payment:1||programming platform:1||quadratic arithmetic program:1||reliability:1||schedule:1||scheduling anomaly:1||short key:1||simulationextractability:1||snarks:1||software development environment:1||software synthesis:1||square arithmetic program:1||storage systems:1||synchronous dataflow graph:1||tamper resistant hardware:1||task graph:1||task migration:1||throughput:1||throughput requirement:1||trusted hardware:1||unequal symbol costs:1||verifiable encryption:1||video:1||wildcard:1||wildcard identity based encryption:1||worstcase performance estimation:1||zeroknowledge:1||zeroknowledge proof:1||zkSNARKs:1||보안 연산 최소화:1||보안 하드웨어:1||속성 기반 서명:1||ASP:1||전자서명:1||Aggregates:1||Aggregation:1||Authentication:1||Big data mining:1||Blockchain application:1||Blockchains:1||Broadcast encryption:1||Buffer mapping:1||Buffer size minimization:1||Checkpoint:1||Clocks:1||Code generation:1||Collaborative approach:1||Compiler:1||Complexity theory:1||Computational modeling:1||Computer languages:1||Constant ciphertext:1||Cost compression:1||Costs:1||Cryptographic protocols:1||Data dependency:1||Data flow computing:1||Dataintensive algorithms:1||Database:1||Dataflow:1||Decentralized Identity Management:1||Design:1||Design methodology:1||Design space exploration:1||Digital signal processing:1||Distributed embedded system:1||Embedded software:1||Encoding:1||Encryption:1||

RSS_1.0 RSS_2.0 ATOM_1.0

222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366

Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.

Detailed Information

Keyword

BROWSE