Sciweavers

436 search results - page 74 / 88
» Using trust assumptions with security requirements
Sort
View
IEEEARES
2007
IEEE
15 years 6 months ago
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
Orhan Cetinkaya, Ali Doganaksoy
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
15 years 5 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
76
Voted
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
15 years 4 months ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
POPL
1998
ACM
15 years 4 months ago
A Type System for Java Bytecode Subroutines
Java is typically compiled into an intermediate language, JVML, that is interpreted by the Java Virtual Machine. Because mobile JVML code is not always trusted, a bytecode verifi...
Raymie Stata, Martín Abadi
AINA
2007
IEEE
15 years 6 months ago
Leveraging Identity-Based Cryptography for Node ID Assignment in Structured P2P Systems
Abstract— Structured peer-to-peer systems have grown enormously because of their scalability, efficiency and reliability. These systems assign a unique identifier to each user ...
Sunam Ryu, Kevin R. B. Butler, Patrick Traynor, Pa...