Sciweavers

147 search results - page 17 / 30
» Logarithmic keying
Sort
View
EUROCRYPT
2011
Springer
13 years 1 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
CRYPTO
2012
Springer
217views Cryptology» more  CRYPTO 2012»
12 years 8 days ago
Securing Circuits against Constant-Rate Tampering
We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et al. ...
Dana Dachman-Soled, Yael Tauman Kalai
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 9 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
14 years 4 months ago
Adaptive-ID Secure Revocable Identity-Based Encryption
Abstract. Identity-Based Encryption (IBE) offers an interesting alternative to PKI-enabled encryption as it eliminates the need for digital certificates. While revocation has bee...
Benoît Libert, Damien Vergnaud
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 3 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong