scientific article; zbMATH DE number 1942446
From MaRDI portal
Publication:4409145
zbMath1028.94511MaRDI QIDQ4409145
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420597.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (34)
On the security loss of unique signatures ⋮ Mercurial commitments with applications to zero-knowledge sets ⋮ Shielded computations in smart contracts overcoming forks ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Memory lower bounds of reductions revisited ⋮ A Novel Certificateless Multi-signature Scheme over NTRU Lattices ⋮ The random oracle model: a twenty-year retrospective ⋮ Explainable arguments ⋮ A novel identity-based multi-signature scheme over NTRU lattices ⋮ Cliptography: Clipping the Power of Kleptographic Attacks ⋮ From Identification to Signatures, Tightly: A Framework and Generic Transforms ⋮ Certificateless key-insulated signature without random oracles ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Multiparty non-interactive key exchange and more from isogenies on elliptic curves ⋮ Encapsulated search index: public-key, sub-linear, distributed, and delegatable ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Adaptive-Secure VRFs with Shorter Keys from Static Assumptions ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Simulatable verifiable random function from the LWE assumption ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Certificate-Based Signature Schemes without Pairings or Random Oracles ⋮ Efficient selective identity-based encryption without random oracles ⋮ Several cryptographic applications of \(\Sigma\)-protocol ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Two-party adaptor signatures from identification schemes ⋮ Efficient Rational Secret Sharing in Standard Communication Networks ⋮ Computing on authenticated data ⋮ Pseudorandom Functions: Three Decades Later
This page was built for publication:
