Round and Computational Efficiency of Multi-party Protocols

Language: English

Published by Springer, Springer Aug 2025, 2025

3031923731 / 9783031923739

  • Softcover
  • New
See all details

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

5-star seller

AbeBooks seller since January 23, 2017

Softcover

Condition: New

£ 187.32

£ 50.99 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - Print on Demand Titel. Neuware -Cryptographic protocols are the backbone of secure digital interactions, but achieving both security and efficiency is a challenging balancing act. The challenge is how to minimize computational costs and reduce interaction while maintaining provable security. This book explores cutting-edge techniques to optimize cryptographic protocols under well-established assumptions.The monograph focuses on secure multi-party computation, non-malleable commitments, and proof systems, presenting new constructions based on general and standard cryptographic assumptions.Topics and features:First optimal-round two-party computation protocol: introduces the first secure, two-party computation protocol (and multi-party protocol for coin-tossing) with black-box simulation under standard assumptions, achieving optimal round complexity in the simultaneous message exchange modelBreakthrough in non-malleable commitments: develops the first four-round, concurrent, non-malleable commitment scheme based on one-way functions and a three-round variant under stronger (still general and standard) assumptionsAdvances in zero-knowledge proofs: non-interactive, Zero-Knowledge proof systems that improve both efficiency and generality, enhancing practical applicability in cryptographic protocolsEfficient witness-indistinguishable proof systems: three-round, witness-indistinguishable proof systems with a novel delayed-input property, with application to interactive zero-knowledgeThis work is primarily intended for researchers, academics, and graduate students in cryptography, theoretical computer science, and cybersecurity who are interested in designing cryptographic protocols from standard and general assumptionsin particular in the setting where no setup is available.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 312 pp. Englisch.…

Seller Inventory # 9783031923739

Title
Round and Computational Efficiency of Multi-party Protocols
Author
Michele Ciampi
Publisher
Springer, Springer Aug 2025
Publication year
2025
Condition
Neu
Binding
Buch
Language
English
ISBN 10
3031923731
ISBN 13
9783031923739
Item weight
633 grams
Dimensions
241x160x23 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germany

5-star seller

AbeBooks seller since January 23, 2017

Shipping rates from Germany to U.S.A.

Item60 to 60 business days60 to 60 business days
First item£ 50.99£ 63.74
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check
  • Paypal

Store description

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specialty

Modernes Antiquariat - Bücher von 1960 bis heute

Seller's business information

buchversandmimpf2000

Germany