MIME-Version: 1.0
References: <Vv-Zz519CQs1JkS8NgeHfI-KGaYelNTxKMikPxdeIRiELmPKlT80g_-BzDgBvpm9MMIr-BRrSyGePC-HFR18QU4uzC0rPJdMzO_hlkUhUaM=@protonmail.com>
In-Reply-To: <Vv-Zz519CQs1JkS8NgeHfI-KGaYelNTxKMikPxdeIRiELmPKlT80g_-BzDgBvpm9MMIr-BRrSyGePC-HFR18QU4uzC0rPJdMzO_hlkUhUaM=@protonmail.com>
From: Lloyd Fournier <lloyd.fourn@gmail.com>
Date: Mon, 1 May 2023 12:23:30 +0800
Message-ID: <CAH5Bsr28mgcLjO43pJKmk7HYKqp9m2eJ0UcGfgOS+H4sFqcTYw@mail.gmail.com>
To: AdamISZ <AdamISZ@protonmail.com>, 
 Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary="000000000000feeb2005fa9a3072"
Subject: Re: [bitcoin-dev] On adaptor security (in protocols)
Precedence: list

--000000000000feeb2005fa9a3072
Content-Type: text/plain; charset="UTF-8"

Hi waxwing,

I think your view of the uselessness of single signer adaptors is too
pessimistic. The claim you make is that they "don't provide a way to
create  enforcement that the publication of signature on a pre-defined
message will reveal a secret'' and so are useless. I think this is wrong.
If I hold a secret key for X and create a signature adaptor with some
encryption key Y with message m and do not create any further signatures
(adaptor or otherwise) on m, then any signature on m that is published
necessarily reveals the secret on Y to me. This is very useful and has
already been used for years by DLCs in production.

I haven't read the proofs in detail but I am optimistic about your
approach. One thing I was considering while reading is that you could make
a general proof against all secure Schnorr signing scheme in the ROM by
simply extending the ROM forwarding approach from Aumayer et al to all
"tweak" operations on the elements that go into the Schnorr challenge hash
i.e. the public key and the nonce. After all whether it's MuSig2, MuSig,
FROST they all must call some RO. I think we can prove that if we apply any
bijective map to the (X,R) tuple before they go into the challenge hash
function then any Schnorr-like scheme that was secure before will be secure
when bip32/TR tweaking (i.e. tweaking X) and adaptor tweaking (tweaking R)
is applied to it. This would be cool because then we could prove all these
variants secure for all schemes past and present in one go. I haven't got a
concrete approach but the proofs I've looked at all seem to share this
structure.

Cheers,

LL

On Sun, 30 Apr 2023 at 00:20, AdamISZ via bitcoin-dev <
bitcoin-dev@lists.linuxfoundation.org> wrote:

> Hi list,
> I was motivated to look more carefully at the question of the security of
> using signature adaptors after recently getting quite enthused about the
> idea of using adaptors across N signing sessions to do a kind of multiparty
> swap. But of course security analysis is also much more important for the
> base case of 2 party swapping, which is of .. some considerable practical
> importance :)
>
> There is work (referenced in Section 3 here) that's pretty substantial on
> "how secure are adaptors" (think in terms of security reductions) already
> from I guess the 2019-2021 period. But I wanted to get into scenarios of
> multiple adaptors at once or multiple signing sessions at once with the
> *same* adaptor (as mentioned above, probably this is the most important
> scenario).
>
> To be clear this is the work of an amateur and is currently unreviewed -
> hence (a) me posting it here and (b) putting the paper on github so people
> can easily add specific corrections or comments if they like:
>
> https://github.com/AdamISZ/AdaptorSecurityDoc/blob/main/adaptorsecurity.pdf
>
> I'll note that I did the analysis only around MuSig, not MuSig2.
>
> The penultimate ("third case"), that as mentioned, of "multiple signing
> sessions, same adaptor" proved to be the most interesting: in trying to
> reduce this to ECDLP I found an issue around sequencing. It may just be
> irrelevant but I'd be curious to hear what others think about that.
>
> If nothing else, I'd be very interested to hear what experts in the field
> have to say about security reductions for this primitive in the case of
> multiple concurrent signing sessions (which of course has been analyzed
> very carefully already for base MuSig(2)).
>
> Cheers,
> AdamISZ/waxwing
>
>
>
>
> Sent with Proton Mail secure email.
> _______________________________________________
> bitcoin-dev mailing list
> bitcoin-dev@lists.linuxfoundation.org
> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>

--000000000000feeb2005fa9a3072
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div>Hi waxwing,</div><div><br></div><div>I think your vie=
w of the uselessness of single signer adaptors is too pessimistic. The clai=
m you make is that they &quot;don&#39;t provide a way to create=C2=A0 enfor=
cement that the publication of signature on a pre-defined message will reve=
al a secret&#39;&#39; and so are useless. I think this is wrong. If I hold =
a secret key for X and create a signature adaptor with some encryption key =
Y with message m and do not create any further signatures (adaptor or other=
wise) on m, then any signature on m that is published necessarily reveals t=
he secret on Y to me. This is very useful and has already been used for yea=
rs by DLCs in production.</div><div><br></div><div>I haven&#39;t read the p=
roofs in detail but I am optimistic about your approach. One thing I was co=
nsidering while reading is that you could make a general proof against all =
secure Schnorr signing scheme in the ROM by simply extending the ROM forwar=
ding approach from Aumayer et al to all &quot;tweak&quot; operations on the=
 elements that go into the Schnorr challenge hash i.e. the public key and t=
he nonce. After all whether it&#39;s MuSig2, MuSig, FROST they all must cal=
l some RO. I think we can prove that if we apply any bijective map to the (=
X,R) tuple before they go into the challenge hash function then any Schnorr=
-like scheme that was secure before will be secure when bip32/TR tweaking (=
i.e. tweaking X) and adaptor tweaking (tweaking R) is applied to it. This w=
ould be cool because then we could prove all these variants secure for all =
schemes past and present in one go. I haven&#39;t got a concrete approach b=
ut the proofs I&#39;ve looked at all seem to share this structure.</div><di=
v><br></div><div>Cheers,</div><div><br></div><div>LL<br></div></div><br><di=
v class=3D"gmail_quote"><div dir=3D"ltr" class=3D"gmail_attr">On Sun, 30 Ap=
r 2023 at 00:20, AdamISZ via bitcoin-dev &lt;<a href=3D"mailto:bitcoin-dev@=
lists.linuxfoundation.org" target=3D"_blank">bitcoin-dev@lists.linuxfoundat=
ion.org</a>&gt; wrote:<br></div><blockquote class=3D"gmail_quote" style=3D"=
margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-lef=
t:1ex">Hi list,<br>
I was motivated to look more carefully at the question of the security of u=
sing signature adaptors after recently getting quite enthused about the ide=
a of using adaptors across N signing sessions to do a kind of multiparty sw=
ap. But of course security analysis is also much more important for the bas=
e case of 2 party swapping, which is of .. some considerable practical impo=
rtance :)<br>
<br>
There is work (referenced in Section 3 here) that&#39;s pretty substantial =
on &quot;how secure are adaptors&quot; (think in terms of security reductio=
ns) already from I guess the 2019-2021 period. But I wanted to get into sce=
narios of multiple adaptors at once or multiple signing sessions at once wi=
th the *same* adaptor (as mentioned above, probably this is the most import=
ant scenario).<br>
<br>
To be clear this is the work of an amateur and is currently unreviewed - he=
nce (a) me posting it here and (b) putting the paper on github so people ca=
n easily add specific corrections or comments if they like:<br>
<br>
<a href=3D"https://github.com/AdamISZ/AdaptorSecurityDoc/blob/main/adaptors=
ecurity.pdf" rel=3D"noreferrer" target=3D"_blank">https://github.com/AdamIS=
Z/AdaptorSecurityDoc/blob/main/adaptorsecurity.pdf</a><br>
<br>
I&#39;ll note that I did the analysis only around MuSig, not MuSig2.<br>
<br>
The penultimate (&quot;third case&quot;), that as mentioned, of &quot;multi=
ple signing sessions, same adaptor&quot; proved to be the most interesting:=
 in trying to reduce this to ECDLP I found an issue around sequencing. It m=
ay just be irrelevant but I&#39;d be curious to hear what others think abou=
t that.<br>
<br>
If nothing else, I&#39;d be very interested to hear what experts in the fie=
ld have to say about security reductions for this primitive in the case of =
multiple concurrent signing sessions (which of course has been analyzed ver=
y carefully already for base MuSig(2)).<br>
<br>
Cheers,<br>
AdamISZ/waxwing<br>
<br>
<br>
<br>
<br>
Sent with Proton Mail secure email.<br>
_______________________________________________<br>
bitcoin-dev mailing list<br>
<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank">=
bitcoin-dev@lists.linuxfoundation.org</a><br>
<a href=3D"https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev" =
rel=3D"noreferrer" target=3D"_blank">https://lists.linuxfoundation.org/mail=
man/listinfo/bitcoin-dev</a><br>
</blockquote></div>

--000000000000feeb2005fa9a3072--