Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash (Q5738783)

From MaRDI portal
Revision as of 02:50, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/pkc/PointchevalST17, #quickstatements; #temporary_batch_1731461124002)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 6729583
Language Label Description Also known as
English
Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash
scientific article; zbMATH DE number 6729583

    Statements

    Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2017
    0 references

    Identifiers