output
20112022
most citedQuantum key distribution with quantum walks

55 citations

25 papers

cs.IR2022

Robust Reputation Independence in Ranking Systems for Multiple Sensitive Attributes

Guilherme Ramos, Ludovico Boratto, Mirko Marras

Ranking systems have an unprecedented influence on how and what information people access, and their impact on our society is being analyzed from different perspectives, such as us…

cs.GT2021★ 3 cited

On the Complexity of Equilibrium Computation in First-Price Auctions

Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender +2

We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price auction with continuous value distributions and discrete bidding space. We prove that when b…

cs.IR2020★ 14 cited

Generating Biomedical Question Answering Corpora from Q&A forums

Andre Lamurias, Diana Sousa, Francisco M. Couto

Question Answering (QA) is a natural language processing task that aims at obtaining relevant answers to user questions. While some progress has been made in this area, biomedical…

quant-ph2020★ 2 cited

A Private Quantum Bit String Commitment

Mariana Gama, Paulo Mateus, André Souto

We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of prese…

cs.IR2020★ 12 cited

BiOnt: Deep Learning using Multiple Biomedical Ontologies for Relation Extraction

Diana Sousa, Francisco M. Couto

Successful biomedical relation extraction can provide evidence to researchers and clinicians about possible unknown associations between biomedical entities, advancing the current…

cs.CR2019★ 16 cited

Statically Detecting Vulnerabilities by Processing Programming Languages as Natural Languages

Ibéria Medeiros, Nuno Neves, Miguel Correia

Web applications continue to be a favorite target for hackers due to a combination of wide adoption and rapid deployment cycles, which often lead to the introduction of high impact…

quant-ph2019★ 20 cited

Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation

Mariano Lemus, Mariana F. Ramos, Preeti Yadav +6

The oblivious transfer primitive is sufficient to implement secure multiparty computation. However, secure multiparty computation based only on classical cryptography is severely l…

quant-ph2019★ 13 cited

Experimental Semi-quantum Key Distribution With Classical Users

Francesco Massa, Preeti Yadav, Amir Moqanaki +5

Quantum key distribution, which allows two distant parties to share an unconditionally secure cryptographic key, promises to play an important role in the future of communication.…

cs.CL2019★ 15 cited

Using Neural Networks for Relation Extraction from Biomedical Literature

Diana Sousa, Andre Lamurias, Francisco M. Couto

Using different sources of information to support automated extracting of relations between biomedical concepts contributes to the development of our understanding of biological sy…

cs.PL2018★ 8 cited

Gradual Session Types

Atsushi Igarashi, Peter Thiemann, Yuya Tsuda +2

Session types are a rich type discipline, based on linear types, that lifts the sort of safety claims that come with type systems to communications. However, web-based applications…

cs.LO2018★ 1 cited

Affine Sessions

Dimitris Mostrous, Vasco T. Vasconcelos

Session types describe the structure of communications implemented by channels. In particular, they prescribe the sequence of communications, whether they are input or output actio…

cs.LG2018

Ensemble learning with Conformal Predictors: Targeting credible predictions of conversion from Mild Cognitive Impairment to Alzheimer's Disease

Telma Pereira, Sandra Cardoso, Dina Silva +3

Most machine learning classifiers give predictions for new examples accurately, yet without indicating how trustworthy predictions are. In the medical domain, this hampers their in…

cs.DC2018★ 27 cited

CYCLOSA: Decentralizing Private Web Search Through SGX-Based Browser Extensions

Rafael Pires, David Goltzsche, Sonia Ben Mokhtar +6

By regularly querying Web search engines, users (unconsciously) disclose large amounts of their personal data as part of their search queries, among which some might reveal sensiti…

cs.DC2018

SITAN: Services for Fault-Tolerant Ad Hoc Networks with Unknown Participants

David R. Matos, Nuno Neves, Alysson Bessani

The evolution of mobile devices with various capabilities (e.g., smartphones and tablets), together with their ability to collaborate in impromptu ad hoc networks, opens new opport…

cs.AI2018★ 6 cited

On Cryptographic Attacks Using Backdoors for SAT

Alexander Semenov, Oleg Zaikin, Ilya Otpuschennikov +2

Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number…

quant-ph2017★ 11 cited

Quantum contract signing with entangled pairs

P. Yadav, P. Mateus, N. Paunković +1

We present a quantum scheme for signing contracts between two clients (Alice and Bob) using entangled states and the services of a third trusted party (Trent). The trusted party is…

cs.NI2017★ 8 cited

ANCHOR: logically-centralized security for Software-Defined Networks

Diego Kreutz, Jiangshan Yu, Fernando M. V. Ramos +1

While the centralization of SDN brought advantages such as a faster pace of innovation, it also disrupted some of the natural defenses of traditional architectures against differen…

quant-ph2017★ 55 cited

Quantum key distribution with quantum walks

Chrysoula Vlachou, Walter Krawec, Paulo Mateus +2

Quantum key distribution is one of the most fundamental cryptographic protocols. Quantum walks are important primitives for computing. In this paper we take advantage of the proper…

cs.PL2017★ 1 cited

Inferring Types for Parallel Programs

Francisco Martins, Vasco Thudichum Vasconcelos, Hans Hüttel

The Message Passing Interface (MPI) framework is widely used in implementing imperative pro- grams that exhibit a high degree of parallelism. The PARTYPES approach proposes a behav…

cs.LO2016★ 42 cited

Efficient Certified Resolution Proof Checking

Luís Cruz-Filipe, Joao Marques-Silva, Peter Schneider-Kamp

We present a novel propositional proof tracing format that eliminates complex processing, thus enabling efficient (formal) proof checking. The benefits of this format are demonstra…

cs.NI2016★ 3 cited

Consistent and fault-tolerant SDN with unmodified switches

André Mantas, Fernando M. V. Ramos

In a reliable SDN environment, different controllers coordinate different switches and backup controllers can be set in place to tolerate faults. This approach increases the challe…

cs.DC2013★ 11 cited

Towards deductive verification of MPI programs against session types

Eduardo R. B. Marques, Francisco Martins, Vasco T. Vasconcelos +2

The Message Passing Interface (MPI) is the de facto standard message-passing infrastructure for developing parallel applications. Two decades after the first version of the library…

cs.AI2013★ 5 cited

Ontology alignment repair through modularization and confidence-based heuristics

Emanuel Santos, Daniel Faria, Cátia Pesquita +1

Ontology Matching aims to find a set of semantic correspondences, called an alignment, between related ontologies. In recent years, there has been a growing interest in efficient a…

cs.DL2013★ 1 cited

Benchmarking some Portuguese S&T system research units: 2nd Edition

Francisco M Couto, Daniel Faria, Bruno Tavares +2

The increasing use of productivity and impact metrics for evaluation and comparison, not only of individual researchers but also of institutions, universities and even countries, h…