Function-Dependent Commitments for Verifiable Multi-party Computation
From MaRDI portal
Publication:6108843
DOI10.1007/978-3-319-99136-8_16zbMath1515.68121OpenAlexW2883848436MaRDI QIDQ6108843
Denis Butin, Johannes A. Buchmann, Denise Demirel, Lucas Schabhüser
Publication date: 30 June 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-99136-8_16
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Internet topics (68M11) Privacy of data (68P27)
Cites Work
- Unnamed Item
- Unnamed Item
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Publicly Auditable Secure Multi-Party Computation
- How to share a secret
- Homomorphic Network Coding Signatures in the Standard Model
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Identity-Based Encryption from the Weil Pairing
- Functional Signatures and Pseudorandom Functions
- Generalizing Homomorphic MACs for Arithmetic Circuits
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
