Sciweavers

216 search results - page 30 / 44
» Formal Proofs for the Security of Signcryption
Sort
View
ESOP
2005
Springer
14 years 1 months ago
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of imp...
Steve Kremer, Mark Ryan
CCS
2007
ACM
14 years 1 months ago
Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing
We construct two new multiparty digital signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature. First, we introduce a new primiti...
Alexandra Boldyreva, Craig Gentry, Adam O'Neill, D...
FC
2008
Springer
134views Cryptology» more  FC 2008»
13 years 9 months ago
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
Vandana Gunupudi, Stephen R. Tate
CRYPTO
2003
Springer
87views Cryptology» more  CRYPTO 2003»
14 years 21 days ago
Private Circuits: Securing Hardware against Probing Attacks
Can you guarantee secrecy even if an adversary can eavesdrop on your brain? We consider the problem of protecting privacy in circuits, when faced with an adversary that can access ...
Yuval Ishai, Amit Sahai, David Wagner
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 8 months ago
MLS security policy evolution with genetic programming
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
Yow Tzu Lim, Pau-Chen Cheng, Pankaj Rohatgi, John ...