Traceable verifiable random functions
From MaRDI portal
Cites work
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Accountability for misbehavior in threshold decryption via threshold traitor tracing
- Better than advertised security for non-interactive threshold signatures
- Born and raised distributively, fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Breaking RSA Generically Is Equivalent to Factoring
- Collusion resistant traitor tracing from learning with errors
- Compact multi-signatures for smaller blockchains
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Efficient Construction of (Distributed) Verifiable Random Functions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Functional encryption for quadratic functions from k-lin, revisited
- How to share a secret
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 1942446 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometric codes
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- MuSig2: simple two-round Schnorr multi-signatures
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- On lattices, learning with errors, random linear codes, and cryptography
- Practical threshold signatures
- Public Key Cryptography - PKC 2005
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Traceable secret sharing and applications
- Traceable secret sharing: strong security and efficient constructions
- Traceable verifiable random functions
- Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin
- Traitor-tracing from LWE made simple and attribute-based
- Vector commitments and their applications
Cited in
(3)
This page was built for publication: Traceable verifiable random functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863964)
