Threshold Schnorr with stateless deterministic signing from standard assumptions

DOI10.1007/978-3-030-84242-0_6zbMath1485.94138OpenAlexW3191289991MaRDI QIDQ2120070

François Garillot, Yashvanth Kondi, Valeria Nikolaenko, Payman Mohassel

Publication date: 31 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_6

zbMATH Keywords

Schnorr's signature schemezero-knowledge from garbled circuits

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

SoK: blockchain light clients ⋮ Provably unforgeable threshold EdDSA with an offline participant and trustless setup ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions

Uses Software

• Ed25519
• libiop
• xJsnark
• Spartan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing authenticated garbling for faster secure two-party computation
• Secure distributed key generation for discrete-log based cryptosystems
• Efficient signature generation by smart cards
• Overdrive: making SPDZ great again
• Efficient adaptively secure zero-knowledge from garbled circuits
• Transparent SNARKs from DARK compilers
• Stacked garbling for disjunctive zero-knowledge proofs
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• Aurora: transparent succinct arguments for R1CS
• Simple Schnorr multi-signatures with applications to bitcoin
• Fast garbling of circuits under standard assumptions
• On the Complexity of Additively Homomorphic UC Commitments
• Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
• Security Proofs for Signature Schemes
• On the Security of the “Free-XOR” Technique
• Compact VSS and Efficient Homomorphic UC Commitments
• Additively Homomorphic UC Commitments with Optimal Amortized Overhead
• The Simplest Protocol for Oblivious Transfer
• Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
• Two Halves Make a Whole
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• High-Speed High-Security Signatures
• Resettable zero-knowledge (extended abstract)
• Improved Garbled Circuit: Free XOR Gates and Applications
• On the Complexity of UC Commitments
• On the Size of Pairing-Based Non-interactive Arguments
• Multiparty generation of an RSA modulus
• Low cost constant round MPC combining BMR and oblivious transfer
• Lattice attacks on digital signature schemes

This page was built for publication: Threshold Schnorr with stateless deterministic signing from standard assumptions