Fault-Tolerant Aggregate Signatures
From MaRDI portal
Publication:2798782
DOI10.1007/978-3-662-49384-7_13zbMath1388.94091OpenAlexW2293223894MaRDI QIDQ2798782
Björn Kaidel, Alexander K. Koch, Jessica Koch, Gunnar Hartung, Andy Rupp
Publication date: 13 April 2016
Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_13
Related Items (5)
Half-aggregation of Schnorr signatures with tight reductions ⋮ Pointcheval-Sanders signature-based synchronized aggregate signature ⋮ Group testing aggregate signatures with soundness ⋮ Identity-based interactive aggregate signatures from lattices ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast congruence closure and extensions
- Weighted congestion games with separable preferences
- Automated deduction. A basis for applications. Vol. 1: Foundations, calculi and methods
- Potential games
- E-Matching with Free Variables
- The complexity of welfare maximization in congestion games
- Congruence Closure with Free Variables
- Theorem Proving with Bounded Rigid E-Unification
- Efficient Algorithms for Bounded Rigid E-unification
- Congestion Games with Player-Specific Constants
- Engineering DPLL(T) + Saturation
- Simplify: a theorem prover for program checking
- Efficient E-Matching for SMT Solvers
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Fast Decision Procedures Based on Congruence Closure
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Concepts in Programming Languages
- Term Rewriting and All That
- Quantifier Instantiation Techniques for Finite Model Finding in SMT
- Algorithms, games, and the internet
This page was built for publication: Fault-Tolerant Aggregate Signatures
