Sciweavers

436 search results - page 48 / 88
» Using trust assumptions with security requirements
Sort
View
133
Voted
ACISP
2009
Springer
15 years 10 months ago
Building Key-Private Public-Key Encryption Schemes
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts correspondi...
Kenneth G. Paterson, Sriramkrishnan Srinivasan
ISCA
2005
IEEE
88views Hardware» more  ISCA 2005»
15 years 9 months ago
Architecture for Protecting Critical Secrets in Microprocessors
We propose “secret-protected (SP)” architecture to enable secure and convenient protection of critical secrets for a given user in an on-line environment. Keys are examples of...
Ruby B. Lee, Peter C. S. Kwan, John Patrick McGreg...
172
Voted
ASIACRYPT
2004
Springer
15 years 7 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
129
Voted
CCR
2007
115views more  CCR 2007»
15 years 3 months ago
Analysis of the SPV secure routing protocol: weaknesses and lessons
We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (...
Barath Raghavan, Saurabh Panjwani, Anton Mityagin
159
Voted
ESORICS
2010
Springer
15 years 5 months ago
Optimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Alptekin Küpçü, Anna Lysyanskaya