Beschreibung
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 optimalround twoparty computation protocol: introduces the first secure, twoparty computation protocol (and multiparty protocol for cointossing) with blackbox simulation under standard assumptions, achieving optimal round complexity in the simultaneous message exchange model Breakthrough in nonmalleable commitments: develops the first fourround, concurrent, nonmalleable commitment scheme based on oneway functions and a threeround variant under stronger (still general and standard) assumptions Advances in zeroknowledge proofs: noninteractive, ZeroKnowledge proof systems that improve both efficiency and generality, enhancing practical applicability in cryptographic protocols Efficient witnessindistinguishable proof systems: threeround, witnessindistinguishable proof systems with a novel delayedinput property, with application to interactive zeroknowledge 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 assumptionsin particular in the setting where no setup is available.
Autorenporträt
Michele Ciampi received his PhD from the University of Salerno. His supervisor was Giuseppe Persiano, the externals were Michel Abdalla and Berry Schoenmakers. He has since worked in the groups of Ivan Visconti, Rafail Ostrovsky, Ivan Damgaard and Claudio Orlandi. He is a researcher in the School of Informatics of the University of Edinburgh. Luisa Siniscalchi received her PhD from the University of Salerno. Her PhD supervisor was Ivan Visconti, the externals were Sanjam Garg and Yuval Ishai. She has since worked in the groups of Ivan Visconti, Rafail Ostrovsky, Ivan Damgaard and Claudio Orlandi. She now works in the Concordium Blockchain Research Center in Aarhus.
Herstellerkennzeichnung:
Springer Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE
E-Mail: juergen.hartmann@springer.com
