A5016988489- Cryptography and Data Security
- Cryptographic Implementations and Security
- Chaos-based Image/Signal Encryption
- Coding theory and cryptography
- Physical Unclonable Functions (PUFs) and Hardware Security
- graph theory and CDMA systems
- DNA and Biological Computing
- Complexity and Algorithms in Graphs
- Cryptography and Residue Arithmetic
- Blockchain Technology Applications and Security
- Cloud Data Security Solutions
- Advanced Malware Detection Techniques
- User Authentication and Security Systems
- Advanced Authentication Protocols Security
- Numerical Methods and Algorithms
- Advanced Data Storage Technologies
- Polynomial and algebraic computation
- Privacy-Preserving Technologies in Data
- Algorithms and Data Compression
- Vehicular Ad Hoc Networks (VANETs)
- Innovation in Digital Healthcare Systems
- IPv6, Mobility, Handover, Networks, Security
- Security in Wireless Sensor Networks
- Library Science and Information Systems
- Product Development and Customization
Chiba Institute of Technology
2024
Toshiba (Japan)
2009-2023
The University of Tokyo
2020
Using cryptographic technologies to provide security solutions in smart grid is extensively discussed NISTIR 7628 [1] and IEC 62351 standards series [2]. Both identify key management for Intelligent Electronic Devices (IEDs) communication as one of the most important issues. In this paper, considering system constraints requirements grid, we propose an authenticated exchange scheme with revocation by exploiting a well-known protocol: Broadcast encryption [3], [11], [12] using media...
The residue number system (RNS) is a method for representing an integer as n-tuple of its residues with respect to given base. Since RNS has inherent parallelism, it actively researched implement faster processing public-key cryptography. This paper proposes new Montgomery reduction algorithms, Q-RNSs, the main part which twice matrix multiplication. Letting n be size base set, unit modular multiplications in proposed algorithms evaluated $$(2n^2+n)$$ . achieved by posing restriction on...
Card-based protocols provide secure multi-party computation using a deck of physical cards via series operations, such as shuffling and turning over cards, that are executed by humans. Although almost all existing have been designed to be perfectly secure, operative errors humans can lead information leakage. In this paper, we propose technique for analyzing leakage due in card-based protocols. particular, introduce concept, which call "probability trace," enhancing the KWH diagram proposed...
Correlation power analysis (CPA) is a well-known attack against cryptographic modules with which an attacker evaluates the correlation between consumption and sensitive data candidates calculated from guessed sub-key known such as plaintexts ciphertexts. This paper enhances CPA to propose new general analysis, built-in determined (BS-CPA), finds by using previously sub-keys recursively compute increase signal-to-noise ratio in its analysis. BS-CPA also reuses traces repetitions of finding...
Abstract Laser fault injection (LFI) attacks on cryptographic processor ICs are a critical threat to information systems. This paper proposes an IC-level integrated countermeasure employing leakage sensor against LFI attack. Distributed bulk current sensors monitor abnormal density caused by laser irradiation for LFI. Time-interleaved operation and sensitivity tuning can obtain partial secret key bit with small layout area penalty. Based the information, be securely updated realize...
Imagine two cryptographers wishing to securely compute the AND value of their secret input bits. They are in kitchen, where all they have three saucepans with Borscht soup and some kinds ingredients. Interestingly, by secretly putting ingredients depending on inputs, can find only from taste cooked Borscht. Because cooking for secure computations is not so convenient, let us regard (with soup) as balls bags, respectively, which easy handle also familiar tools learning Probability high...
Abstract In the history of cryptography, many cryptographic protocols have relied on random coin tosses to prove their security. Although flipping coins is indispensable in this manner, themselves never been spotlight. Therefore, we would like make physical rise level just as a deck playing cards has used perform secure multi-party computation. Such card-based protocol known be helpful both computation without any black-box computers and understand principles protocols. paper, propose new...
The re-keying scheme is a variant of the symmetric encryption where sender (respectively, receiver) encrypts decrypts) plaintext with temporal session key derived from master secret and publicly-shared randomness. It one system-level countermeasures against side channel attacks (SCAs), which make attackers unable to collect enough power consumption traces for their analyses by updating randomness (i.e., key) frequently. In 2015, Dobraunig et al. proposed two kinds schemes. first without...
The PayWord scheme was proposed by Rivest and Shamir for micropayments. This paper points out that it has the following problem: a malicious customer can damage bank purchasing in excess of customer's credit which guaranteed issuing certificate. In general, there are two positions with regard to Position 1: takes full responsibility certificate compensates all payments created purchases; 2: doesn't redeem exceeding limit set shares loss shop if trouble occurs. Scheme, reduce its risk...
Paral and Devadas introduced a simple key generation scheme with physically unclonable function (PUF) that requires no error correction, e.g., by using fuzzy extractor. Their scheme, called pattern matching (PMKG) is based on between auxiliary data, assigned at the enrollment in advance, substring of PUF output, to reconstruct key. The PMKG repeats round operation, including matching, derive high entropy. Later, enhance efficiency security, circular (C-PMKG) was proposed. However, multiple...
Ring signature scheme enables a signer to sign message anonymously. In the ring scheme, who wants document anonymously first chooses some public keys of entities (signers) and then generates which ensures that one or signs document. situations, however, allows shift blame victims because anonymity. The group may be solution for problem; it needs an electronic big brother, called manager, can violate anonymity by himself, complicated key setting. This paper introduces new notion with...
A new model for a Client-Server Communication (CSC) system satisfying information theoretic security is proposed, and its fundamental properties are discussed. Our CSC allows n users to upload their respective messages server securely by using symmetric key encryptions with own keys, all ciphertexts decrypted the server. If we require be perfectly secure in against corrupted clients adversaries without any it proved that one time pad or more inefficient encryption must used each...