Sciweavers

77 search results - page 7 / 16
» Evaluation Properties of Symmetric Polynomials
Sort
View
CSL
2006
Springer
15 years 3 months ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
Vincent Atassi, Patrick Baillot, Kazushige Terui
ASIACRYPT
2003
Springer
15 years 4 months ago
A Traceable Block Cipher
In this paper1 we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys prov...
Olivier Billet, Henri Gilbert
CRYPTO
2010
Springer
186views Cryptology» more  CRYPTO 2010»
15 years 24 days ago
Additively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
Carlos Aguilar Melchor, Philippe Gaborit, Javier H...
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 5 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
TIT
2008
164views more  TIT 2008»
14 years 11 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung