Sciweavers

264 search results - page 4 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
14 years 5 days ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
13 years 9 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
CCS
2003
ACM
14 years 1 months ago
Formal access control analysis in the software development process
Security is a crucial aspect in any modern software system. To ensure security in the final product, security requirements must be considered in the entire software development p...
Manuel Koch, Francesco Parisi-Presicce
EUROCRYPT
2011
Springer
12 years 12 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
IEEEARES
2010
IEEE
14 years 1 months ago
Architecture-Aware Adaptive Deployment of Contextual Security Policies
—Deploying a security policy may prove difficult whenever the system does not embed all necessary security functionalities. Some specific functionalities are required to accura...
Stere Preda, Nora Cuppens-Boulahia, Fréd&ea...