Sciweavers

659 search results - page 77 / 132
» Compiling and securing cryptographic protocols
Sort
View
SASN
2003
ACM
15 years 5 months ago
Admission control in Peer-to-Peer: design and performance evaluation
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...
Nitesh Saxena, Gene Tsudik, Jeong Hyun Yi
IACR
2011
132views more  IACR 2011»
14 years 5 days ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
89
Voted
NCA
2003
IEEE
15 years 5 months ago
Admission Control in Peer Groups
Security in collaborative peer groups is an active research topic. Most previous work focused on key management without addressing an important pre-requisite: admission control, i...
Yongdae Kim, Daniele Mazzocchi, Gene Tsudik
92
Voted
CSFW
2007
IEEE
15 years 7 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
105
Voted
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 1 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai