Sound Proof of Proximity of Knowledge

About
Privacy
Disclaimer

Graph Chatbot

Related publications (28)

Page 2 of 2

A test of inventory models with permissible delay in payment

Ralf Seifert, Olov Isaksson

Contrary to the long-standing view in the finance literature that firms should maximise payment delays, research in operations management suggests that long payment delays can be suboptimal. In this study, we reconcile these two views by applying a seconda ...

2017

Found in translation: Quantum chemical tools for grasping non-covalent interactions

Anne-Clémence Corminboeuf, Ewa Maria Pastorczak

Today's quantum chemistry methods are extremely powerful but rely upon complex quantities such as the massively multidimensional wave function or even the simpler electron density. Consequently, chemical insight and a chemist's intuition are often lost in ...

Amer Inst Physics2017

Learning to Scale Payments in Crowdsourcing with PropeRBoost

Boi Faltings, Goran Radanovic

Motivating workers to provide significant effort has been recognized as an important issue in crowdsourcing. It is important not only to compensate worker effort, but also to discourage low-quality workers from participating. Several proper incentive schem ...

2016

Uniqueness of equilibrium in a payment system with liquidation costs

Damir Filipovic, Léo Hamed Amini

We study a financial network where forced liquidations of an illiquid asset have a negative impact on its price, thus reinforcing network contagion. We give conditions for uniqueness of the clearing asset price and liability payments. Our main result holds ...

Elsevier Science Bv2016

Real-Time Optimization Based on Adaptation of Surrogate Models

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti, Martand Singhal

Recently, different real-time optimization (RTO) schemes that guarantee feasibility of all RTO iterates and monotonic convergence to the optimal plant operating point have been proposed. However, simulations reveal that these schemes converge very slowly t ...

Elsevier Science Bv2016

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Authenticated Encryption with Variable Stretch

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

In conventional authenticated-encryption (AE) schemes, the ciphertext expansion, a.k.a.stretch or tag length, is a constant or a parameter of the scheme that must be fixed per key. However, using variable-length tags per key can be desirable in practice or ...

Springer-Verlag Berlin2016

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016