IACR 2016 - PDF Preprint Papers

IACR 2016

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IACR-2016 Paper

click to vote

IACR
2016

154views Biometrics» more IACR 2016»

Intel SGX Explained

8 years 7 months ago

Download eprint.iacr.org

Intel’s Software Guard Extensions (SGX) is a set of extensions to the Intel architecture that aims to provide integrity and conﬁdentiality guarantees to securitysensitive comp...

Victor Costan, Srinivas Devadas

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	154	Intel SGX Explained	claim
2	147	Neeva: A Lightweight Hash Function	claim
3	130	Anonymous Role-Based Access Control on E-Health Records	claim
4	126	Provably Weak Instances of Ring-LWE Revisited	claim
5	119	Per-Session Security: Password-Based Cryptography Revisited	claim
6	118	Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters	claim
7	106	Cryptanalysis of the New CLT Multilinear Map over the Integers	claim
8	80	Collaborative Multi-Authority KP-ABE for Shorter Keys and Parameters	claim
9	73	Circuit-ABE from LWE: Unbounded Attributes and Semi-Adaptive Security	claim
10	73	Algorithmic Countermeasures Against Fault Attacks and Power Analysis for RSA-CRT	claim
11	70	Optimizing S-box Implementations for Several Criteria using SAT Solvers	claim
12	68	Foundations of Hardware-Based Attested Computation and Application to SGX	claim
13	68	Fault-Tolerant Aggregate Signatures	claim
14	68	From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions	claim
15	67	Accountable Privacy for Decentralized Anonymous Payments	claim
16	64	Downgrade Resilience in Key-Exchange Protocols	claim
17	64	Revisiting Structure Graph and Its Applications to CBC-MAC and EMAC	claim
18	62	Fully Anonymous Transferable Ecash	claim
19	62	MEMS-based Gyroscopes as Physical Unclonable Functions	claim
20	61	Analysis of Gong et al.'s CCA2-Secure Homomorphic Encryption	claim
21	60	Fault analysis and weak key-IV attack on Sprout	claim
22	60	Packet Header Anomaly Detection Using Bayesian Topic Models	claim
23	59	On Splitting a Point with Summation Polynomials in Binary Elliptic Curves	claim
24	59	Access Control Encryption: Enforcing Information Flow with Cryptography	claim
25	58	A Distinguisher on PRESENT-Like Permutations with Application to SPONGENT	claim
26	57	Semantic Security and Key-Privacy With Random Split of St-Gen Codes	claim
27	57	Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations	claim
28	57	Characterizations of the Degraded Boolean Function and Cryptanalysis of the SAFER Family	claim
29	57	On a decentralized trustless pseudo-random number generation algorithm	claim
30	56	CacheBleed: A Timing Attack on OpenSSL Constant Time RSA	claim
31	56	Honey Encryption Beyond Message Recovery Security	claim
32	53	Improved Fully Homomorphic Encryption with Composite Number Modulus	claim
33	53	Improved on an improved remote user authentication scheme with key agreement	claim
34	52	Still Wrong Use of Pairings in Cryptography	claim
35	52	How Fast Can Higher-Order Masking Be in Software?	claim
36	52	An Encryption Scheme based on Random Split of St-Gen Codes	claim
37	52	New Approaches for Secure Outsourcing Algorithm for Modular Exponentiations	claim
38	52	Robust Password-Protected Secret Sharing	claim
39	51	A Cryptographic Analysis of the TLS 1.3 draft-10 Full and Pre-shared Key Handshake Protocol	claim
40	51	Capacity and Data Complexity in Multidimensional Linear Attack	claim
41	51	On the division property of S-boxes	claim
42	51	Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN	claim
43	51	Nonce-based Kerberos is a Secure Delegated AKE Protocol	claim
44	50	An Alternative View of the Graph-Induced Multilinear Maps	claim
45	50	A Practical Template Attack on MICKEY-128 2.0 Using PSO Generated IVs and LS-SVM	claim
46	50	Side-Channel Watchdog: Run-Time Evaluation of Side-Channel Vulnerability in FPGA-Based Crypto-systems	claim
47	50	Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE	claim
48	50	New Attacks on the Concatenation and XOR Hash Combiners	claim
49	50	Server Notaries: A Complementary Approach to the Web PKI Trust Model	claim
50	49	Analysing and Exploiting the Mantin Biases in RC4	claim
51	49	Valiant's Universal Circuit is Practical	claim
52	49	Improved Side-Channel Analysis Attacks on Xilinx Bitstream Encryption of 5, 6, and 7 Series	claim
53	49	On the Leakage-Resilient Key Exchange	claim
54	48	A Memory Encryption Engine Suitable for General Purpose Processors	claim
55	48	A New Birthday-Type Algorithm for Attacking the Fresh Re-Keying Countermeasure	claim
56	48	PrAd: Enabling Privacy-Aware Location based Advertising	claim
57	48	Safely Exporting Keys from Secure Channels: On the security of EAP-TLS and TLS Key Exporters	claim
58	48	Fully Homomorphic Public-key Encryption Based on Discrete Logarithm Problem	claim
59	48	Proofs of Space-Time and Rational Proofs of Storage	claim
60	47	The Honey Badger of BFT Protocols	claim
61	47	On the Power of Secure Two-Party Computation	claim
62	47	Comb to Pipeline: Fast Software Encryption Revisited	claim
63	47	ECDSA Key Extraction from Mobile Devices via Nonintrusive Physical Side Channels	claim
64	47	Human-readable Proof of the Related-Key Security of AES-128	claim
65	47	Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes	claim
66	47	Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts	claim
67	47	Commutativity, Associativity, and Public Key Cryptography	claim
68	46	On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography	claim
69	46	Blindly Signed Contracts: Anonymous On-Blockchain and Off-Blockchain Bitcoin Transactions	claim
70	46	Breaking the Sub-Exponential Barrier in Obfustopia	claim
71	46	Polytopic Cryptanalysis	claim
72	46	On the (In)security of SNARKs in the Presence of Oracles	claim
73	46	The Magic of ELFs	claim
74	46	On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack	claim
75	46	Fully homomorphic encryption must be fat or ugly?	claim
76	46	Attribute-Based Signatures for Circuits from Bilinear Map	claim
77	46	Cryptanalysis of Simpira	claim
78	46	OPFE: Outsourcing Computation for Private Function Evaluation	claim
79	45	Cryptanalysis of the Full Spritz Stream Cipher	claim
80	45	Better Security for Functional Encryption for Inner Product Evaluations	claim
81	45	Attacks and parameter choices in HIMMO	claim
82	45	Universal Composition with Responsive Environments	claim
83	45	Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1	claim
84	45	Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness	claim
85	45	A Maiorana-McFarland Construction of a GBF on Galois ring	claim
86	45	A trivial debiasing scheme for Helper Data Systems	claim
87	45	Provably Robust Sponge-Based PRNGs and KDFs	claim
88	45	Eliminating Decryption Failures from the Simple Matrix Encryption Scheme	claim
89	45	A note on Tensor Simple Matrix Encryption Scheme	claim
90	44	A NEW UNLINKABLE SECRET HANDSHAKES SCHEME BASED ON ZSS	claim
91	44	Speed Optimizations in Bitcoin Key Recovery Attacks	claim
92	44	Pseudoentropy: Lower-bounds for Chain rules and Transformations	claim
93	44	Strong Continuous Non-malleable Encoding Schemes with Tamper-Detection	claim
94	44	More Practical and Secure History-Independent Hash Tables	claim
95	44	White-Box Cryptography in the Gray Box - A Hardware Implementation and its Side Channels	claim
96	44	Automatic Expectation and Variance Computing for Attacks on Feistel Schemes	claim
97	44	Invariant subspaces in Simpira	claim
98	44	Key Compression for Isogeny-Based Cryptosystems	claim
99	44	Fully-Secure Lattice-Based IBE as Compact as PKE	claim
100	44	New Lattice Attacks on DSA Schemes	claim
101	44	Cryptanalysis of PRINCE with Minimal Data	claim
102	44	Improved on an efficient user authentication scheme for heterogeneous wireless sensor network tailored for the Internet of Things environment	claim
103	44	Compositions of linear functions and applications to hashing	claim
104	44	On the Computation of the Optimal Ate Pairing at the 192-bit Security Level	claim
105	43	Rate-1, Linear Time and Additively Homomorphic UC Commitments	claim
106	43	A Framework for Outsourcing of Secure Computation	claim
107	43	Interactive Oracle Proofs	claim
108	43	Speed and Area Optimized Parallel Higher-Radix Modular Multipliers	claim
109	43	Smooth NIZK Arguments with Applications to Asymmetric UC-PAKE	claim
110	43	Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs	claim
111	43	Constant-Round Asynchronous Multi-Party Computation	claim
112	43	On Statistically Secure Obfuscation with Approximate Correctness	claim
113	43	A trustless privacy-preserving reputation system	claim
114	43	There is Wisdom in Harnessing the Strengths of your Enemy: Customized Encoding to Thwart Side-Channel Attacks - Extended Version -	claim
115	43	Improved Integral and Zero-correlation Linear Cryptanalysis of Reduced-round CLEFIA Block Cipher	claim
116	42	On the Size of Pairing-based Non-interactive Arguments	claim
117	42	Post-quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation	claim
118	42	Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness	claim
119	42	Circular Security Counterexamples for Arbitrary Length Cycles from LWE	claim
120	42	On Post-Compromise Security	claim
121	42	On Garbling Schemes With And Without Privacy	claim
122	42	Fast Multiparty Multiplications from shared bits	claim
123	42	Reduced Memory Meet-in-the-Middle Attack against the NTRU Private Key	claim
124	42	Algorithms for the Approximate Common Divisor Problem	claim
125	42	Integrals go Statistical: Cryptanalysis of Full Skipjack Variants	claim
126	42	A Columnar Transposition cipher in a contemporary setting	claim
127	42	A MAC Mode for Lightweight Block Ciphers	claim
128	42	Lightweight Multiplication in GF(2^n) with Applications to MDS Matrices	claim
129	42	Open Sesame: The Password Hashing Competition and Argon2	claim
130	42	On the tightness of the error bound in Ring-LWE	claim
131	42	Topology-based Plug-and-Play Key-Setup	claim
132	41	Cryptanalysis of 6-round PRINCE using 2 Known Plaintexts	claim
133	41	How To Simulate It - A Tutorial on the Simulation Proof Technique	claim
134	41	Practical backward unlinkable revocation in FIDO, German e-ID, Idemix and U-Prove	claim
135	41	Obfuscation without Multilinear Maps	claim
136	41	On the nonlinearity of monotone Boolean functions	claim
137	41	ZKBoo: Faster Zero-Knowledge for Boolean Circuits	claim
138	41	Circuit Compilers with O(1/ log(n)) Leakage Rate	claim
139	41	Linguistic Cracking of Passphrases Using Markov Chains	claim
140	41	A Subgradient Algorithm For Computational Distances and Applications to Cryptography	claim
141	40	Threshold-optimal DSA/ECDSA signatures and an application to Bitcoin wallet security	claim
142	40	MU-ORAM: Dealing with Stealthy Privacy Attacks in Multi-User Data Outsourcing Services	claim
143	40	On Linear Hulls and Trails in Simon	claim
144	40	On low degree polynomials in 2-round AES	claim
145	40	Lightweight MDS Generalized Circulant Matrices	claim
146	40	Process Table Covert Channels: Exploitation and Countermeasures	claim
147	40	Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13	claim
148	40	The Exact Round Complexity of Secure Computation	claim
149	40	Refund attacks on Bitcoin's Payment Protocol	claim
150	40	Isogeny-based Quantum-resistant Undeniable Blind Signature Scheme	claim
151	39	Practical DRAM PUFs in Commodity Devices	claim
152	39	On Bitcoin Security in the Presence of Broken Crypto Primitives	claim
153	39	Fixed Point Arithmetic in SHE Scheme	claim
154	39	Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond	claim
155	39	How to Generalize RSA Cryptanalyses	claim
156	38	Balloon Hashing: Provably Space-Hard Hash Functions with Data-Independent Access Patterns	claim
157	38	On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model	claim
158	38	3-Message Zero Knowledge Against Human Ignorance	claim
159	38	Key Derivation for Squared-Friendly Applications: Lower Bounds	claim
160	37	Town Crier: An Authenticated Data Feed for Smart Contracts	claim
161	37	Randomness Complexity of Private Circuits for Multiplication	claim
162	37	An Improvement of Both Security and Reliability for Keccak Implementations on Smart Card	claim
163	37	Valiant's Universal Circuit: Improvements, Implementation, and Applications	claim
164	37	Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security	claim
165	36	Bounding basis reduction properties	claim
166	36	Better Preprocessing for Secure Multiparty Computation	claim
167	36	Beyond the selective disclosure of ABCs on RAM-constrained devices	claim
168	36	Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement	claim
169	36	Quantum Collision-Resistance of Non-Uniformly Distributed Functions	claim
170	35	Fully-Anonymous Short Dynamic Group Signatures Without Encryption	claim
171	35	Improved Progressive BKZ Algorithms and their Precise Cost Estimation by Sharp Simulator	claim
172	35	Cryptanalysis of ring-LWE based key exchange with key share reuse	claim
173	34	Computing theta functions in quasi-linear time in genus 2 and above	claim
174	33	Computing Private Set Operations with Linear Complexities	claim
175	32	Implementing a Toolkit for Ring-LWE Based Cryptography in Arbitrary Cyclotomic Number Fields	claim
176	32	Tightly-Secure Pseudorandom Functions via Work Factor Partitioning	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers