Short signatures without random oracles and the SDH assumption in bilinear groups
From MaRDI portal
Publication:2425530
Recommendations
Cites work
- A composition theorem for universal one-way hash functions
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Elliptic Curve Cryptography
- Efficient pairing computation on supersingular abelian varieties
- scientific article; zbMATH DE number 1617933 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- scientific article; zbMATH DE number 1759350 (Why is no real title available?)
- scientific article; zbMATH DE number 1759351 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2086700 (Why is no real title available?)
- scientific article; zbMATH DE number 1842501 (Why is no real title available?)
- On the Security of HFE, HFEv- and Quartz
- Pairing-Friendly Elliptic Curves of Prime Order
- Public Key Cryptography - PKC 2005
- Public Key Cryptography – PKC 2004
- Reducing elliptic curve logarithms to logarithms in a finite field
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Security analysis of the Gennaro-Halevi-Rabin signature scheme
- Security Analysis of the Strong Diffie-Hellman Problem
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Short signatures from the Weil pairing
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- The Eta Pairing Revisited
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The Weil pairing, and its efficient calculation
Cited in
(only showing first 100 items - show all)- Secure and efficient identity-based proxy signature scheme in the standard model based on computational Diffie-Hellman problem
- Short digital signatures and ID-KEMs via truncation collision resistance
- Short signatures from the Weil pairing
- Subversion-resilient signatures: definitions, constructions and applications
- An efficient online/offline ID-based short signature procedure using extended chaotic maps
- PRE: stronger security notions and efficient construction with non-interactive opening
- Confined guessing: new signatures from standard assumptions
- Boosting verifiable computation on encrypted data
- Efficient redactable signature and application to anonymous credentials
- Group signatures with user-controlled and sequential linkability
- A classification of computational assumptions in the algebraic group model
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Dynamic universal accumulator with batch update over bilinear groups
- Anonymous single-sign-on for \(n\) designated services with traceability
- Robust digital signature revisited
- Speeding-up verification of digital signatures
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Shorter ring signatures from standard assumptions
- Identity-based signatures in standard model
- Efficient fully structure-preserving signatures and shrinking commitments
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
- On the analysis of cryptographic assumptions in the generic ring model
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Tight security for signature schemes without random oracles
- Combined schemes for signature and encryption: the public-key and the identity-based setting
- Authenticated hash tables based on cryptographic accumulators
- Accountable identity-based encryption with distributed private key generators
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Scalable Divisible E-cash
- Secret handshakes with dynamic expressive matching policy
- Linear encryption with keyword search
- A new signature scheme without random oracles from bilinear pairings
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Anonymous Data Collection System with Mediators
- Tight proofs for signature schemes without random oracles
- A signature scheme with efficient proof of validity
- New short group signature scheme without random oracles
- Towards restricting plaintext space in public key encryption
- Short signatures from weaker assumptions
- Ambiguous one-move nominative signature without random oracles
- Constant size ring signature without random oracle
- Unconditionally anonymous ring and mesh signatures
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- A practical leakage-resilient signature scheme in the generic group model
- Unique signature with short output from CDH assumption
- Programmable Hash Functions and Their Applications
- Divisible On-Line/Off-Line Signatures
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- Twin signature schemes, revisited
- How to achieve non-repudiation of origin with privacy protection in cloud computing
- Programmable hash functions and their applications
- scientific article; zbMATH DE number 1962145 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- Optimistic fair exchange in the enhanced chosen-key model
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- An anonymous designated verifier signature scheme with revocation: how to protect a company's reputation
- A timed-release proxy re-encryption scheme and its application to fairly-opened multicast communication
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Group signatures with decentralized tracing
- Round-efficient anonymous password-authenticated key exchange protocol in the standard model
- Practical verifiably encrypted signatures without random oracles
- Advances in Cryptology - EUROCRYPT 2004
- An efficient and strongly unforgeable short signature scheme in standard model
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
- Short Undeniable Signatures Without Random Oracles: The Missing Link
- Short Threshold Signature Schemes Without Random Oracles
- Efficient Dynamic Broadcast Encryption and Its Extension to Authenticated Dynamic Broadcast Encryption
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- On the Equivalence of Generic Group Models
- Cut down the tree to achieve constant complexity in divisible e-cash
- An efficient self-blindable attribute-based credential scheme
- Efficient round-optimal blind signatures in the standard model
- Public Key Cryptography - PKC 2006
- Discrete logarithm problems with auxiliary inputs
- Generic constructions of integrated PKE and PEKS
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- Generic models for group actions
- PAPR: publicly auditable privacy revocation for anonymous credentials
- Revisiting BBS signatures
- Optimal generic attack against basic Boneh-Boyen signatures
- Lattice signature with efficient protocols, application to anonymous credentials
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Scored anonymous credentials
- On black-box knowledge-sound commit-and-prove SNARKs
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Efficient selective identity-based encryption without random oracles
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
- Multi-signer locally verifiable aggregate signature from (leveled) multilinear maps
- Improved lattice blind signatures from recycled entropy
- Multi-Holder anonymous credentials from BBS signatures
- Server-aided anonymous credentials
- Blind signatures from proofs of inequality
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Jackpot: non-interactive aggregatable lotteries
This page was built for publication: Short signatures without random oracles and the SDH assumption in bilinear groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425530)
