Sciweavers

1562 search results - page 33 / 313
» Mathematics, Cryptology, Security
Sort
View
CRYPTO
2009
Springer
131views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
Benny Applebaum, David Cash, Chris Peikert, Amit S...
CRYPTO
2006
Springer
232views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
Hao Chen, Ronald Cramer
CRYPTO
2008
Springer
107views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Circular-Secure Encryption from Decision Diffie-Hellman
We describe a public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use. In particular, it remains secure under a "key cy...
Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Os...
FC
2008
Springer
105views Cryptology» more  FC 2008»
13 years 9 months ago
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Abstract. We consider general secure function evaluation (SFE) of private functions (PF-SFE). Recall, privacy of functions is often most efficiently achieved by general SFE [18,19,...
Vladimir Kolesnikov, Thomas Schneider 0003
CRYPTOLOGIA
2010
13 years 5 months ago
Internet Voting Protocol Based on Improved Implicit Security
This paper presents an improved protocol for Internet voting that allows recasting of ballots to eliminate voting errors, encourages early voting and provides an opportunity for c...
Abhishek Parakh, Subhash Kak