default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasutada Oohama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c44]Yasutada Oohama, Bagus Santoso:
Universal Source Encryption under Side-Channel Attacks. ISIT 2024: 3344-3349- 2023
- [i34]Bagus Santoso, Yasutada Oohama:
Universal Coding for Shannon Ciphers under Side-Channel Attacks. CoRR abs/2302.01314 (2023) - 2022
- [c43]Yasutada Oohama, Bagus Santoso:
A Framework for Shannon Ciphers under Side-Channel Attacks: a Strong Converse and More. ISIT 2022: 862-867 - [c42]Vamoua Yachongka
, Hideki Yagi, Yasutada Oohama:
Secret Key-based Authentication With Passive Eavesdropper for Scalar Gaussian Sources. ISIT 2022: 2666-2671 - [c41]Yasutada Oohama, Bagus Santoso:
A Framework for Distributed Source Coding with Encryption: a New Strong Converse and More. ISITA 2022: 189-193 - [i33]Yasutada Oohama, Bagus Santoso:
Strong Converse Theorem for Source Encryption under Side-Channel Attacks. CoRR abs/2201.11670 (2022) - [i32]Vamoua Yachongka, Hideki Yagi, Yasutada Oohama:
Secret Key-based Authentication With Passive Eavesdropper for Scalar Gaussian Sources. CoRR abs/2202.10018 (2022) - [i31]Yutaka Jitsumatsu, Yasutada Oohama:
A Family of Algorithms for Computing Information-Theoretic Forms of Strong Converse Exponents in Channel Coding and Lossy Source Coding. CoRR abs/2205.06027 (2022) - 2021
- [j35]Vamoua Yachongka, Hideki Yagi, Yasutada Oohama:
Biometric Identification Systems with Noisy Enrollment for Gaussian Sources and Channels. Entropy 23(8): 1049 (2021) - [j34]Yutaka Jitsumatsu, Ukyo Michiwaki, Yasutada Oohama:
Conditional Information Leakage Given Eavesdropper's Received Signals in Wiretap Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(1): 295-304 (2021) - [c40]Yasutada Oohama, Bagus Santoso:
Strong Converse for Distributed Source Coding with Encryption Using Correlated Keys. ITW 2021: 1-6 - [i30]Yasutada Oohama, Bagus Santoso:
Distributed Source Coding with Encryption Using Correlated Keys. CoRR abs/2102.06363 (2021) - 2020
- [j33]Yasutada Oohama:
Performance Analysis of the Interval Algorithm for Random Number Generation in the Case of Markov Coin Tossing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12): 1325-1336 (2020) - [j32]Yutaka Jitsumatsu, Yasutada Oohama:
A New Iterative Algorithm for Computing the Correct Decoding Probability Exponent of Discrete Memoryless Channels. IEEE Trans. Inf. Theory 66(3): 1585-1606 (2020) - [c39]Yasutada Oohama:
Strong Converse for the State Dependent Channel. ISIT 2020: 2126-2130 - [c38]Yasutada Oohama:
Exponent Function for the Gel'fand-Pinsker Channel at Rates above the Capacity. ISITA 2020: 36-40 - [c37]Vamoua Yachongka, Hideki Yagi, Yasutada Oohama:
Biometric Identification Systems With Noisy Enrollment for Gaussian Source. ITW 2020: 1-5 - [i29]Vamoua Yachongka, Hideki Yagi, Yasutada Oohama:
Biometric Identification Systems With Noisy Enrollment for Gaussian Source. CoRR abs/2010.10799 (2020)
2010 – 2019
- 2019
- [j31]Bagus Santoso, Yasutada Oohama:
Information Theoretic Security for Shannon Cipher System under Side-Channel Attacks †. Entropy 21(5): 469 (2019) - [j30]Hisa-Aki Tanaka, Masaki Nakagawa, Yasutada Oohama:
A Direct Link between Rényi-Tsallis Entropy and Hölder's Inequality - Yet Another Proof of Rényi-Tsallis Entropy Maximization. Entropy 21(6): 549 (2019) - [j29]Yasutada Oohama:
Exponential Strong Converse for One Helper Source Coding Problem. Entropy 21(6): 567 (2019) - [j28]Bagus Santoso, Yasutada Oohama:
Information Theoretic Security for Broadcasting of Two Encrypted Sources under Side-Channel Attacks †. Entropy 21(8): 781 (2019) - [j27]Noboru Kunihiro, Yasutada Oohama:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(12): 1590 (2019) - [j26]Bagus Santoso, Yasutada Oohama:
Secrecy Amplification of Distributed Encrypted Sources With Correlated Keys Using Post-Encryption-Compression. IEEE Trans. Inf. Forensics Secur. 14(11): 3042-3056 (2019) - [c36]Bagus Santoso, Yasutada Oohama:
Secure Broadcasting of Two Encrypted Sources under Side-Channel Attacks. ISIT 2019: 305-309 - [c35]Yasutada Oohama:
An Inequality Useful for Proofs of Strong Converse Theorems in Network Information Theory. ISIT 2019: 2883-2887 - [c34]Yasutada Oohama:
Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime. ITW 2019: 1-5 - [c33]Bagus Santoso, Yasutada Oohama, Chunhua Su:
Measuring Security of Symmetric Encryption Schemes Against On-the-Fly Side-Channel Key-Recovery Attacks. NSS 2019: 3-17 - [i28]Yasutada Oohama:
A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks. CoRR abs/1901.04968 (2019) - [i27]Bagus Santoso, Yasutada Oohama:
Information Theoretic Security for Broadcasting of Two Encrypted Sources under Side-Channel Attacks. CoRR abs/1901.05940 (2019) - [i26]Yutaka Jitsumatsu, Ukyo Michiwaki, Yasutada Oohama:
The Conditional Information Leakage Given Eavesdropper's Received Signals in Wiretap Channels. CoRR abs/1901.06442 (2019) - [i25]Yasutada Oohama:
New Converse Bounds for Discrete Memoryless Channels in the Finite Blocklength Regime. CoRR abs/1904.04894 (2019) - 2018
- [j25]Yasutada Oohama:
Exponential Strong Converse for Source Coding with Side Information at the Decoder. Entropy 20(5): 352 (2018) - [j24]Yasutada Oohama:
Equivalence of Two Exponent Functions for Discrete Memoryless Channels with Input Cost at Rates above the Capacity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2199-2204 (2018) - [j23]Yasutada Oohama:
On a Relationship between the Correct Probability of Estimation from Correlated Data and Mutual Information. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2205-2209 (2018) - [c32]Yasutada Oohama, Bagus Santoso:
Information Theoretical Analysis of Side-Channel Attacks to the Shannon Cipher System. ISIT 2018: 581-585 - [c31]Bagus Santoso, Yasutada Oohama:
Post Encryption Compression with Affine Encoders for Secrecy Amplification in Distributed Source Encryption with Correlated Keys. ISITA 2018: 737-741 - [i24]Yasutada Oohama, Bagus Santoso:
Information Theoretic Security for Side-Channel Attacks to the Shannon Cipher System. CoRR abs/1801.02563 (2018) - [i23]Bagus Santoso, Yasutada Oohama:
Secrecy Amplification for Distributed Encrypted Sources with Correlated Keys using Affine Encoders. CoRR abs/1801.04920 (2018) - 2017
- [c30]Bagus Santoso, Yasutada Oohama:
Privacy amplification of distributed encrypted sources with correlated keys. ISIT 2017: 958-962 - [c29]Yasutada Oohama:
The optimal exponent function for the additive white Gaussian noise channel at rates above the capacity. ISIT 2017: 1053-1057 - [i22]Yasutada Oohama:
The Reliability Function for the Additive White Gaussian Noise Channel at Rates above the Capacity. CoRR abs/1701.06357 (2017) - [i21]Yasutada Oohama:
Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity. CoRR abs/1701.06545 (2017) - [i20]Yasutada Oohama:
On a Relationship between the Correct Probability of Estimation from Correlated Data and Mutual Information. CoRR abs/1702.01285 (2017) - 2016
- [c28]Yutaka Jitsumatsu, Yasutada Oohama:
Computing the optimal exponent of correct decoding for discrete memoryless sources. ISIT 2016: 1531-1535 - [c27]Yasutada Oohama:
Exponent function for Wyner-Ziv source coding problem at rates below the rate distortion function. ISITA 2016: 171-175 - [c26]Yasutada Oohama:
Exponent function for asymmetric broadcast channels at rates outside the capacity region. ISITA 2016: 537-541 - [c25]Yasutada Oohama:
Strong converse for state dependent channels with full state information at the sender and partial state information at the receiver. ITW 2016: 126-130 - [i19]Yasutada Oohama:
Exponent Function for Source Coding with Side Information at the Decoder at Rates below the Rate Distortion Function. CoRR abs/1601.05650 (2016) - [i18]Yutaka Jitsumatsu, Yasutada Oohama:
An Iterative Algorithm for Computing the Optimal Exponent of Correct Decoding Probability for Rates below the Rate Distortion Function. CoRR abs/1601.06094 (2016) - [i17]Yasutada Oohama:
Strong Converse Exponent for State Dependent Channels with Full State Information at the Sender and Partial State Information at the Receiver. CoRR abs/1603.06344 (2016) - [i16]Yasutada Oohama:
New Strong Converse for Asymmetric Broadcast Channels. CoRR abs/1604.02901 (2016) - 2015
- [j22]Yasutada Oohama:
Gaussian CEO Problem in the Case of Scalar Source and Vector Observations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2367-2375 (2015) - [j21]Yasutada Oohama:
On Two Strong Converse Theorems for Discrete Memoryless Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2471-2475 (2015) - [j20]Shun Watanabe, Yasutada Oohama:
The Optimal Use of Rate-Limited Randomness in Broadcast Channels With Confidential Messages. IEEE Trans. Inf. Theory 61(2): 983-995 (2015) - [c24]Yasutada Oohama, Yutaka Jitsumatsu:
A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels. ISIT 2015: 924-928 - [c23]Yasutada Oohama:
Strong converse exponent for degraded broadcast channels at rates outside the capacity region. ISIT 2015: 939-943 - [c22]Yasutada Oohama:
Exponent function for one helper source coding problem at rates outside the rate region. ISIT 2015: 1575-1579 - [c21]Yasutada Oohama:
Strong converse theorems for degraded broadcast channels with feedback. ISIT 2015: 2510-2514 - [i15]Yasutada Oohama:
Exponent Function for One Helper Source Coding Problem at Rates outside the Rate Region. CoRR abs/1504.05891 (2015) - [i14]Yasutada Oohama:
Strong Converse Exponent for Degraded Broadcast Channels at Rates outside the Capacity Region. CoRR abs/1504.05941 (2015) - [i13]Yasutada Oohama:
Strong Converse Theorems for Degraded Broadcast Channels with Feedback. CoRR abs/1504.05948 (2015) - 2014
- [j19]Yasutada Oohama:
Indirect and Direct Gaussian Distributed Source Coding Problems. IEEE Trans. Inf. Theory 60(12): 7506-7539 (2014) - [j18]Shun Watanabe, Yasutada Oohama:
Cognitive Interference Channels With Confidential Messages Under Randomness Constraint. IEEE Trans. Inf. Theory 60(12): 7698-7707 (2014) - [c20]Yasutada Oohama:
One helper source coding problem for a class of correlated sources with memory. ISIT 2014: 581-585 - [c19]Yasutada Oohama:
Rate distortion for source coding with Markov side information at the decoder. ISITA 2014: 551-555 - [c18]Yasutada Oohama:
Encoding of markov sources with partial memoryless side information at the decoder. ISITA 2014: 556-560 - 2013
- [j17]Yasutada Oohama:
Converse Coding Theorems for Identification via Channels. IEEE Trans. Inf. Theory 59(2): 744-759 (2013) - [c17]Yasutada Oohama:
Converse coding theorems for identification via multiple access channels. ISIT 2013: 1650-1654 - [i12]Yasutada Oohama:
Outer Bound of the Capacity Region for Identification via Multiple Access Channels. CoRR abs/1301.7046 (2013) - 2012
- [j16]Matthieu R. Bloch, Mérouane Debbah, Yingbin Liang, Yasutada Oohama, Andrew Thangaraj:
Special issue on physical-layer security. J. Commun. Networks 14(4): 349-351 (2012) - [j15]Yasutada Oohama:
Distributed Source Coding of Correlated Gaussian Remote Sources. IEEE Trans. Inf. Theory 58(8): 5059-5085 (2012) - [c16]Shun Watanabe, Yasutada Oohama:
Broadcast channels with confidential messages by randomness constrained stochastic encoder. ISIT 2012: 61-65 - [c15]Yasutada Oohama:
On two strong converse theorems for discrete memoryless channels. ISITA 2012: 46-50 - [c14]Shun Watanabe, Yasutada Oohama:
Cognitive interference channels with confidential messages under randomness constraint. ISITA 2012: 697-701 - [c13]Shun Watanabe, Yasutada Oohama:
Privacy amplification theorem for bounded storage eavesdropper. ITW 2012: 177-181 - [i11]Shun Watanabe, Yasutada Oohama:
Broadcast Channels with Confidential Messages by Randomness Constrained Stochastic Encoder. CoRR abs/1201.6468 (2012) - [i10]Shun Watanabe, Yasutada Oohama:
Cognitive Interference Channels with Confidential Messages under Randomness Constraint. CoRR abs/1204.5663 (2012) - 2011
- [j14]Shun Watanabe, Yasutada Oohama:
Secret Key Agreement From Vector Gaussian Sources by Rate Limited Public Communication. IEEE Trans. Inf. Forensics Secur. 6(3-1): 541-550 (2011) - [j13]Yasutada Oohama:
Performance Analysis of the Interval Algorithm for Random Number Generation Based on Number Systems. IEEE Trans. Inf. Theory 57(3): 1177-1185 (2011) - [c12]Yasutada Oohama:
Characterization of a part of the rate distortion region for the gaussian distributed source coding. ISIT 2011: 56-60 - 2010
- [j12]Yasutada Oohama:
Gaussian Zig-Zag Source Coding Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1889-1903 (2010) - [j11]Shun Watanabe, Yasutada Oohama:
Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1976-1983 (2010) - [c11]Yasutada Oohama:
Distributed source coding of correlated memoryless Gaussian observations. ISIT 2010: 51-55 - [c10]Shun Watanabe, Yasutada Oohama:
Secret key agreement from vector Gaussian sources by rate limited public communication. ISIT 2010: 2597-2601 - [c9]Yasutada Oohama:
On the rate distortion region of Gaussian multiterminal source coding. ISITA 2010: 714-719 - [i9]Shun Watanabe, Yasutada Oohama:
Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication. CoRR abs/1001.3705 (2010) - [i8]Yasutada Oohama:
Distributed Source Coding of Correlated Gaussian Sources. CoRR abs/1007.4418 (2010) - [i7]Yasutada Oohama:
On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels. CoRR abs/1008.1140 (2010) - [i6]Shun Watanabe, Yasutada Oohama:
Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public Communication. CoRR abs/1009.5760 (2010) - [i5]Yasutada Oohama, Shun Watanabe:
Capacity Results for Relay Channels with Confidential Messages. CoRR abs/1009.5829 (2010)
2000 – 2009
- 2009
- [i4]Yasutada Oohama:
Many-Help-One Problem for Gaussian Sources with a Tree Structure on their Correlation. CoRR abs/0901.1988 (2009) - [i3]Yasutada Oohama:
Distributed Source Coding of Correlated Gaussian Remote Sources. CoRR abs/0904.0751 (2009) - [i2]Yasutada Oohama:
Distributed Source Coding for Correlated Memoryless Gaussian Sources. CoRR abs/0908.3982 (2009) - 2008
- [c8]Yasutada Oohama:
Rate distortion region for distributed source coding of correlated Gaussian remote sources. ISIT 2008: 41-45 - [c7]Yasutada Oohama:
Multiterminal source coding problem with several side informations at the decoder. ISIT 2008: 687-691 - 2007
- [j10]Yasutada Oohama:
Intrinsic Randomness Problem in the Framework of Slepian-Wolf Separate Coding System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(7): 1406-1417 (2007) - [c6]Yasutada Oohama:
Capacity Theorems for Relay Channels with Confidential Messages. ISIT 2007: 926-930 - 2006
- [c5]Yasutada Oohama:
Gaussian Multiterminal Source Coding with Several Side Informations at the Decoder. ISIT 2006: 1409-1413 - [i1]Yasutada Oohama:
Relay Channels with Confidential Messages. CoRR abs/cs/0611125 (2006) - 2005
- [j9]Ken-ichi Iwata, Yasutada Oohama:
Information-Spectrum Characterization of Broadcast Channel with General Source. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2808-2818 (2005) - [j8]Ken-ichi Iwata, Yasutada Oohama:
Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(11): 3196-3202 (2005) - [j7]Yasutada Oohama:
Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder. IEEE Trans. Inf. Theory 51(7): 2577-2593 (2005) - [c4]Yasutada Oohama:
Multiterminal random number generation in of separate coding systems. ISIT 2005: 478-481 - [c3]Yasutada Oohama:
Explicit expression of the interval algorithm for random number generation based on number systems. ITW 2005: 157-161 - 2003
- [j6]Yasutada Oohama, Mariko Suemitsu, Tohru Kohda:
Construction of a Piecewise Linear One-Dimensional Map Generating an Arbitrary Prescribed Tree Source. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(9): 2251-2255 (2003) - 2002
- [j5]Yasutada Oohama, Tohru Kohda:
Statistical Properties of Chaotic Binary Sequences Generated by One-Dimensional Maps. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(9): 1993-2002 (2002) - [c2]Yasutada Oohama:
Converse coding theorem for the identification via multiple access channels. ITW 2002: 155-158 - 2001
- [c1]Yasutada Oohama:
Coding for relay channels with confidential messages. ITW 2001: 87-89
1990 – 1999
- 1998
- [j4]Yasutada Oohama:
The Rate-Distortion Function for the Quadratic Gaussian CEO Problem. IEEE Trans. Inf. Theory 44(3): 1057-1070 (1998) - 1997
- [j3]Yasutada Oohama:
Gaussian multiterminal source coding. IEEE Trans. Inf. Theory 43(6): 1912-1923 (1997) - 1996
- [j2]Yasutada Oohama:
Universal coding for correlated sources with linked encoders. IEEE Trans. Inf. Theory 42(3): 837-847 (1996) - 1994
- [j1]Yasutada Oohama, Te Sun Han:
Universal coding for the Slepian-Wolf data compression system and the strong converse theorem. IEEE Trans. Inf. Theory 40(6): 1908-1919 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
