scientific article; zbMATH DE number 2085203
From MaRDI portal
Publication:4736430
zbMath1067.94554MaRDI QIDQ4736430
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2259/22590165.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
A fast parallel modular exponentiation algorithm ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ A short non-delegatable strong designated verifier signature ⋮ GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs ⋮ TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks ⋮ Smooth projective hashing and two-message oblivious transfer ⋮ Efficient precomputation schemes of \(kP+lQ\) ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ How to Make the Cramer-Shoup Cryptosystem Secure Against Linear Related-Key Attacks ⋮ EPG-representations with Small Grid-Size ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Simplified small exponent test for batch verification ⋮ Universal designated verifier signature scheme with non-delegatability in the standard model ⋮ Exponentiation in Pairing-Friendly Groups Using Homomorphisms ⋮ A Multivariate Encryption Scheme with Rainbow ⋮ On Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption Schemes ⋮ Securing RSA against Fault Analysis by Double Addition Chain Exponentiation ⋮ Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves ⋮ SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
This page was built for publication:
