Shun Watanabe

Orcid: 0000-0002-1121-8633

According to our database1, Shun Watanabe authored at least 88 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation.
CoRR, 2024

17.4 Environmentally-Friendly Disposable Circuit and Battery System for Reducing Impact of E-Wastes.
Proceedings of the IEEE International Solid-State Circuits Conference, 2024

2023
Bit-Security Preserving Hardness Amplification.
IACR Cryptol. ePrint Arch., 2023

Complete Characterization of Broadcast and Pseudo-Signatures from Correlations.
IACR Cryptol. ePrint Arch., 2023

A Geometric Reduction Approach for Identity Testing of Reversible Markov Chains.
CoRR, 2023

Tight Exponential Strong Converse for Source Coding Problem with Encoded Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Comparison of the Accuracy of Pouch Replacement Timing Decisions Using Image Generation Artificial Intelligence and Machine Learning.
Proceedings of the Human-Computer Interaction, 2023

Geometric Reduction for Identity Testing of Reversible Markov Chains.
Proceedings of the Geometric Science of Information - 6th International Conference, 2023

2022
Minimax Converse for Identification via Channels.
IEEE Trans. Inf. Theory, 2022

Unified View for Notions of Bit Security.
IACR Cryptol. ePrint Arch., 2022

Geometric Aspects of Data-Processing of Markov Chains.
CoRR, 2022

Optimal trajectory generation of a drone for wheelchair tracking using mixed-integer programming.
Artif. Life Robotics, 2022

On Sub-optimality of Random Binning for Distributed Hypothesis Testing.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Bit Security as Computational Cost for Winning Games with High Probability.
IACR Cryptol. ePrint Arch., 2021

Information Geometry of Reversible Markov Chains.
CoRR, 2021

The Achievable Rate Region of Wyner-Ahlswede-Körner Coding Problem for Mixed Sources.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
Interval Algorithm for Random Number Generation: Information Spectrum Approach.
IEEE Trans. Inf. Theory, 2020

A Classification of Functions in Multiterminal Distributed Computing.
IEEE Trans. Inf. Theory, 2020

Strong Converse Using Change of Measure Arguments.
IEEE Trans. Inf. Theory, 2020

Communication for Generating Correlation: A Unifying Survey.
IEEE Trans. Inf. Theory, 2020

Finite-Length Analyses for Source and Channel Coding on Markov Chains.
Entropy, 2020

Gait Analysis of Walking Locomotion Enhanced by an Impedance-Controlled Gait-Aid Walker-Type Robot.
Proceedings of the 2020 IEEE/SICE International Symposium on System Integration, 2020

Isomorphism Problem Revisited: Information Spectrum Approach.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Gait Assessment on EMG and Trunk Acceleration with Impedance-Controlled Gait-Aid Walker-Type Robot.
Proceedings of the IEEE/ASME International Conference on Advanced Intelligent Mechatronics, 2020

2019
A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem.
Electron. Colloquium Comput. Complex., 2019

Communication for Generating Correlation: A Survey.
CoRR, 2019

2018
Neyman-Pearson Test for Zero-Rate Multiterminal Hypothesis Testing.
IEEE Trans. Inf. Theory, 2018

Interactive Communication for Data Exchange.
IEEE Trans. Inf. Theory, 2018

Second-Order Optimal Test in Composite Hypothesis Testing.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
Second-Order Region for Gray-Wyner Network.
IEEE Trans. Inf. Theory, 2017

Universal Multiparty Data Exchange and Secret Key Agreement.
IEEE Trans. Inf. Theory, 2017

On Distributed Computing for Functions With Certain Structures.
IEEE Trans. Inf. Theory, 2017

A converse bound on Wyner-Ahlswede-Körner Network via Gray-Wyner network.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Optimality of the recursive data exchange protocol.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Channel Simulation and Coded Source Compression.
IEEE Trans. Inf. Theory, 2016

Uniform Random Number Generation From Markov Chains: Non-Asymptotic and Asymptotic Analyses.
IEEE Trans. Inf. Theory, 2016

Secret Key Agreement: General Capacity and Second-Order Asymptotics.
IEEE Trans. Inf. Theory, 2016

Universal multiparty data exchange.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
The Optimal Use of Rate-Limited Randomness in Broadcast Channels With Confidential Messages.
IEEE Trans. Inf. Theory, 2015

Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information.
IEEE Trans. Inf. Theory, 2015

Converses For Secret Key Agreement and Secure Computing.
IEEE Trans. Inf. Theory, 2015

A Dichotomy of Functions in Distributed Coding: An Information Spectral Approach.
IEEE Trans. Inf. Theory, 2015

An Information-Spectrum Approach to Weak Variable-Length Source Coding With Side-Information.
IEEE Trans. Inf. Theory, 2015

Information Complexity Density and Simulation of Protocols.
Electron. Colloquium Comput. Complex., 2015

Fully quantum source compression with a quantum helper.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Impossibility bounds for secure computing.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Common randomness for secure computing.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Source compression with a quantum helper.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Cognitive Interference Channels With Confidential Messages Under Randomness Constraint.
IEEE Trans. Inf. Theory, 2014

Universal Wyner-Ziv Coding for Distortion Constrained General Side Information.
IEEE Trans. Inf. Theory, 2014

Optimal axis compensation in quantum key distribution protocols over unital channels.
Theor. Comput. Sci., 2014

The Recollection Characteristics of Generalized MCNN Using Different Control Methods.
J. Robotics Netw. Artif. Life, 2014

A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing.
IACR Cryptol. ePrint Arch., 2014

Non-asymptotic and asymptotic analyses on Markov chains in several problems.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Finite-length analysis on tail probability and simple hypothesis testing for Markov chain.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Strong converse and second-order asymptotics of channel resolvability.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Moderate deviations for joint source-channel coding of systems with Markovian memory.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An information-spectrum approach to weak variable-length Slepian-Wolf coding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Information geometry approach to parameter estimation in Markov chains.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Strong converse for a degraded wiretap channel via active hypothesis testing.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Converse results for secrecy generation over channels.
Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, 2014

2013
The Rate-Distortion Function for Product of Two Sources With Side-Information at Decoders.
IEEE Trans. Inf. Theory, 2013

A gesture recognition system with retina-V1 model and one-pass dynamic programming.
Neurocomputing, 2013

Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information
CoRR, 2013

A method for analyzing the spatiotemporal changes of chaotic neural networks.
Artif. Life Robotics, 2013

Non-asymptotic and second-order achievability bounds for source coding with side-information.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropy.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Secret key capacity for multipleaccess channel with public feedback.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Non-asymptotic bounds on fixed length source coding for Markov chains.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Privacy amplification theorem for bounded storage eavesdropper.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Expurgation exponent of leaked information in privacy amplification for binary sources.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Broadcast channels with confidential messages by randomness constrained stochastic encoder.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Secret Key Agreement From Vector Gaussian Sources by Rate Limited Public Communication.
IEEE Trans. Inf. Forensics Secur., 2011

Remarks on Private and Quantum Capacities of More Capable and Less Noisy Quantum Channels
CoRR, 2011

A Gesture Recognition System Using One-Pass DP Method.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2011

2010
Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Capacity Results for Relay Channels with Confidential Messages
CoRR, 2010

2009
Universal Source Coding OverGeneralized Complementary Delivery Networks.
IEEE Trans. Inf. Theory, 2009

Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Simulating molecular motor uni-cast information rate for molecular communication.
Proceedings of the 43rd Annual Conference on Information Sciences and Systems, 2009

2008
Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Secret key agreement by reliability information of signals in Gaussian Maurer's Model.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Bee-inspired data collection methods for P2P streaming systems.
Proceedings of the 3rd International ICST Conference on Bio-Inspired Models of Network, 2008

2007
Universal source coding over generalized complementary delivery networks
CoRR, 2007

Key rate of quantum key distribution with hashed two-way classical communication.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2005
Noise tolerance of the BB84 protocol with random privacy amplification.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005


  Loading...