Monotone-policy aggregate signatures
From MaRDI portal
Publication:6637524
DOI10.1007/978-3-031-58737-5_7MaRDI QIDQ6637524
Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth
Publication date: 13 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The hunting of the SNARK
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- On the existence of extractable one-way functions
- Programmable Hash Functions in the Multilinear Setting
- Universal Signature Aggregators
- How to share a secret
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Non-interactive delegation and batch NP verification from standard computational assumptions
- How to delegate computations publicly
- Advances in Cryptology - EUROCRYPT 2004
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- SNARGs for monotone policy batch NP
- Verifiable private information retrieval
- Correlation intractability and SNARGs from sub-exponential DDH
- Boosting batch arguments and RAM delegation
This page was built for publication: Monotone-policy aggregate signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637524)
