Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming
Sign Up to like & getrecommendations! Published in 2018 at "Physical Review A"
DOI: 10.1103/physreva.97.042302
Abstract: Bit-commitment is a fundamental cryptographic task where Alice wishes to commit to Bob a bit in such a way that it cannot be changed while simultaneously being hidden from Bob. It is known that ideal… read more here.
Keywords: bit; simple proof; bit commitment; cone ... See more keywords
A simple proof of the generalized Leibniz rule on bounded Euclidean domains
Sign Up to like & getrecommendations! Published in 2021 at "Forum Mathematicum"
DOI: 10.1515/forum-2020-0228
Abstract: Abstract This paper is devoted to a simple proof of the generalized Leibniz rule in bounded domains. The operators under consideration are the so-called spectral Laplacian and the restricted Laplacian. Equations involving such operators have… read more here.
Keywords: leibniz rule; rule bounded; generalized leibniz; bounded domains ... See more keywords