Efficient and universally composable single secret leader election from pairings

DOI10.1007/978-3-031-31368-4_17zbMath1527.94077OpenAlexW3158172685MaRDI QIDQ6070772

Dario Catalano, Emanuele Giunta, Dario Fiore

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_17

zbMATH Keywords

distributed algorithms for key generation and encryptionproof of stake blockchains

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Zero-knowledge proofs of knowledge for group homomorphisms
• Pairings for cryptographers
• The wonderful world of global random oracles
• Threshold cryptosystems from threshold fully homomorphic encryption
• Attribute-hiding predicate encryption in bilinear groups, revisited
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• On the Non-malleability of the Fiat-Shamir Transform
• Functional Encryption: Definitions and Challenges
• Universally Composable Synchronous Computation
• Advances in Cryptology - EUROCRYPT 2004
• Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

This page was built for publication: Efficient and universally composable single secret leader election from pairings