Sciweavers

1628 search results - page 207 / 326
» Compiler Construction Using Scheme
Sort
View
ECCC
2007
144views more  ECCC 2007»
15 years 4 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
CORR
2010
Springer
77views Education» more  CORR 2010»
15 years 3 months ago
Reduced ML-Decoding Complexity, Full-Rate STBCs for $2^a$ Transmit Antenna Systems
— For an nt transmit, nr receive antenna system (nt × nr system), a full-rate space time block code (STBC) transmits nmin = min(nt, nr) complex symbols per channel use and in ge...
K. Pavan Srinath, B. Sundar Rajan
IMCSIT
2010
15 years 2 months ago
Learning taxonomic relations from a set of text documents
This paper presents a methodology for learning taxonomic relations from a set of documents that each explain one of the concepts. Three different feature extraction approaches with...
Mari-Sanna Paukkeri, Alberto Pérez Garc&iac...
ASIACRYPT
2004
Springer
15 years 10 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
171
Voted
ICISC
2000
126views Cryptology» more  ICISC 2000»
15 years 6 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...