Name: Round and Computational Efficiency of Multi-party Protocols
SKU: 64792162
Price: 192.53 EUR
Availability: InStock
Author: Luisa Siniscalchi;Michele Ciampi
ISBN: 9783031923739

portada Round and Computational Efficiency of Multi-party Protocols

Round and Computational Efficiency of Multi-party Protocols

Type

Physical Book

Publisher

Springer International Publishing AG

Author

Luisa Siniscalchi;Michele Ciampi

Collection

Information Security and Cryptography

Year

2025

Pages

295

Format

Hardcover

Dimensions

23.5x15.5 cm

ISBN13

9783031923739

Round and Computational Efficiency of Multi-party Protocols

Luisa Siniscalchi;Michele Ciampi (Author) · Springer International Publishing AG · Hardcover

Cheaper New Book Imported to Netherlands

Delivery: 17 Nov - 24 Nov

€ 192,53

Faster New Book Imported to Netherlands

Delivery: 12 Nov - 16 Nov

€ 243,64

Import costs and 9% BTW included in the price ✅

€ 192,53

Add to Wishlist

Synopsis "Round and Computational Efficiency of Multi-party Protocols"

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 assumptions—in particular in the setting where no setup is available.