Round and Computational Efficiency of Multi-party Protocols
Series: Information Security and Cryptography;
- Publisher's listprice EUR 213.99
-
90 325 Ft (86 023 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 12% (cc. 10 839 Ft off)
- Discounted price 79 485 Ft (75 700 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
90 325 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer Nature Switzerland
- Date of Publication 2 October 2025
- Number of Volumes 1 pieces, Book
- ISBN 9783031923739
- Binding Hardback
- No. of pages296 pages
- Size 235x155 mm
- Language English
- Illustrations XVI, 296 p. 26 illus. Illustrations, black & white 700
Categories
Long description:
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 model
- Breakthrough 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) assumptions
- Advances in zero-knowledge proofs: non-interactive, Zero-Knowledge proof systems that improve both efficiency and generality, enhancing practical applicability in cryptographic protocols
- Efficient witness-indistinguishable proof systems: three-round, witness-indistinguishable proof systems with a novel delayed-input property, with application to interactive zero-knowledge
This 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.
More
Table of Contents:
Part I, Preliminaries.- 1 Introduction.- 2 Preliminaries.- Part II, Secure Two-Party Computation.- Round Optimal 2-Party Computation.- Private Set-Membership in the Semi-honest Setting.- Part III, Non-malleable Primitives.- Three-Round Non-malleable Commitment.- Delayed-Input Non-malleable Zero Knowledge.- Four-Round Concurrent Non-malleable Commitments from One-Way Functions.- Part IV, Efficient Proof Systems.- Improved OR Composition.- Delayed-Input Witness Indistinguishable Proofs of Knowledge.- Non-interactive Zero-Knowledge Without Programmable Random Oracles.
More
