André Souto

Orcid: 0000-0001-8792-959X

Affiliations:
  • University of Lisbon, Portugal


According to our database1, André Souto authored at least 42 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines.
Quantum, January, 2024

2023
Light-SAE: A Lightweight Authentication Protocol for Large-Scale IoT Environments Made With Constrained Devices.
IEEE Trans. Netw. Serv. Manag., September, 2023

Zgli: A Pipeline for Clustering by Compression with Application to Patient Stratification in Spondyloarthritis.
Sensors, February, 2023

Software-based security approach for networked embedded devices.
CoRR, 2023

A Network Server for Distributing Quantum Random Numbers.
Proceedings of the 23rd International Conference on Transparent Optical Networks, 2023

The Smelly Eight: An Empirical Study on the Prevalence of Code Smells in Quantum Computing.
Proceedings of the 45th IEEE/ACM International Conference on Software Engineering, 2023

2022
Experimental Semi-quantum Key Distribution With Classical Users.
Quantum, September, 2022

2021
On Conditional Tsallis Entropy.
Entropy, 2021

The Entropy Universe.
Entropy, 2021

QBugs: A Collection of Reproducible Bugs in Quantum Algorithms and a Supporting Infrastructure to Enable Controlled Quantum Software Testing and Debugging Experiments.
Proceedings of the 2nd IEEE/ACM International Workshop on Quantum Software Engineering, 2021

2020
Using Low-Density Parity-Check codes to improve the McEliece cryptosystem.
Inf. Sci., 2020

A Private Quantum Bit String Commitment.
Entropy, 2020

2019
Quantum Contract Signing with Entangled Pairs.
Entropy, 2019

Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation.
CoRR, 2019

On minimal assumptions to obtain a universally composable quantum bit commitment.
Proceedings of the 21st International Conference on Transparent Optical Networks, 2019

2018
Quantum key distribution with quantum walks.
Quantum Inf. Process., 2018

Kolmogorov One-Way Functions Revisited.
Cryptogr., 2018

Time Bounded Incompressible Theorem Reversed.
Proceedings of the 9th IEEE International Conference on Intelligent Systems, 2018

Witness Hiding Without Extractors or Simulators.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
On the rate of decrease in logical depth.
Theor. Comput. Sci., 2017

Sophistication vs Logical Depth.
Theory Comput. Syst., 2017

Universality of quantum Turing machines with deterministic control.
J. Log. Comput., 2017

Quantum machines with classical control.
CoRR, 2017

2016
Distinguishing Two Probability Ensembles with One Sample from each Ensemble.
Theory Comput. Syst., 2016

Quantum walks public key cryptographic system.
CoRR, 2016

2014
Oblivious transfer based on quantum state computational distinguishability.
CoRR, 2014

Oblivious transfer based on single-qubit rotations.
CoRR, 2014

Enhancing Privacy with Quantum Networks.
Proceedings of the Communications and Multimedia Security, 2014

2013
One-Way Functions Using Algorithmic and Classical Information Theories.
Theory Comput. Syst., 2013

On the logical depth function
CoRR, 2013

On Logical Depth and the Running Time of Shortest Programs.
CoRR, 2013

Sophistication as Randomness Deficiency.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Low-Depth Witnesses are Easy to Find.
Comput. Complex., 2012

Robustness of Logical Depth.
Proceedings of the How the World Computes, 2012

2011
Entropy Measures vs. Kolmogorov Complexity.
Entropy, 2011

2010
Information measures for infinite sequences.
Theor. Comput. Sci., 2010

Entropy measures vs. algorithmic information.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Kolmogorov Complexity Cores.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Depth as Randomness Deficiency.
Theory Comput. Syst., 2009

Commitment and authentication systems.
Des. Codes Cryptogr., 2009

Measuring communication complexity using instance complexity with oracles
CoRR, 2009

2006
Galois Field Commitment Scheme.
IACR Cryptol. ePrint Arch., 2006


  Loading...